./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:17:48,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:17:49,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:17:49,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:17:49,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:17:49,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:17:49,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:17:49,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:17:49,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:17:49,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:17:49,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:17:49,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:17:49,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:17:49,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:17:49,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:17:49,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:17:49,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:17:49,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:17:49,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:17:49,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:17:49,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:17:49,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:17:49,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:17:49,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:17:49,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:17:49,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:17:49,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:17:49,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:17:49,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:17:49,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:17:49,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:17:49,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:17:49,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:17:49,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:17:49,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:17:49,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:17:49,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:17:49,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:17:49,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:17:49,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:17:49,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:17:49,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:17:49,043 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-10-13 03:17:49,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:17:49,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:17:49,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:17:49,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:17:49,252 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:17:49,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-10-13 03:17:50,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:17:50,710 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:17:50,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-10-13 03:17:50,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22577825/c518c7117df942dd8e347479b3aaba31/FLAG3f298b9f7 [2024-10-13 03:17:51,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22577825/c518c7117df942dd8e347479b3aaba31 [2024-10-13 03:17:51,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:17:51,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:17:51,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:17:51,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:17:51,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:17:51,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcbac6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51, skipping insertion in model container [2024-10-13 03:17:51,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:17:51,294 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-10-13 03:17:51,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:17:51,348 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:17:51,357 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-10-13 03:17:51,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:17:51,400 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:17:51,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51 WrapperNode [2024-10-13 03:17:51,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:17:51,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:17:51,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:17:51,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:17:51,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,448 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-13 03:17:51,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:17:51,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:17:51,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:17:51,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:17:51,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,485 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-10-13 03:17:51,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:17:51,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:17:51,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:17:51,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:17:51,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (1/1) ... [2024-10-13 03:17:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:17:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:17:51,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:17:51,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:17:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:17:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:17:51,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:17:51,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:17:51,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:17:51,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:17:51,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:17:51,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:17:51,928 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-13 03:17:51,929 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:17:51,966 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:17:51,966 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:17:51,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:17:51 BoogieIcfgContainer [2024-10-13 03:17:51,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:17:51,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:17:51,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:17:51,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:17:51,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:17:51" (1/3) ... [2024-10-13 03:17:51,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b4c3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:17:51, skipping insertion in model container [2024-10-13 03:17:51,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:17:51" (2/3) ... [2024-10-13 03:17:51,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b4c3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:17:51, skipping insertion in model container [2024-10-13 03:17:51,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:17:51" (3/3) ... [2024-10-13 03:17:51,974 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i [2024-10-13 03:17:51,987 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:17:51,987 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:17:52,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:17:52,048 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;@491bb872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:17:52,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:17:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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-10-13 03:17:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 03:17:52,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:52,065 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] [2024-10-13 03:17:52,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1580267608, now seen corresponding path program 1 times [2024-10-13 03:17:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075492522] [2024-10-13 03:17:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:52,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:52,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075492522] [2024-10-13 03:17:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075492522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:17:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797557737] [2024-10-13 03:17:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:52,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:17:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:52,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:17:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:17:52,441 INFO L87 Difference]: Start difference. First operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-10-13 03:17:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:52,490 INFO L93 Difference]: Finished difference Result 129 states and 214 transitions. [2024-10-13 03:17:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:17:52,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 112 [2024-10-13 03:17:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:52,500 INFO L225 Difference]: With dead ends: 129 [2024-10-13 03:17:52,501 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 03:17:52,504 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-10-13 03:17:52,508 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:52,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:17:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 03:17:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 03:17:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 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-10-13 03:17:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-10-13 03:17:52,543 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 112 [2024-10-13 03:17:52,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:52,544 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-10-13 03:17:52,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-10-13 03:17:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-10-13 03:17:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 03:17:52,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:52,549 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] [2024-10-13 03:17:52,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:17:52,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:52,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -734562012, now seen corresponding path program 1 times [2024-10-13 03:17:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:52,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353825587] [2024-10-13 03:17:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:52,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:52,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353825587] [2024-10-13 03:17:52,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353825587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:52,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:52,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:17:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937198759] [2024-10-13 03:17:52,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:52,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:17:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:52,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:17:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:17:52,755 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-13 03:17:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:52,806 INFO L93 Difference]: Finished difference Result 155 states and 230 transitions. [2024-10-13 03:17:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:17:52,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 112 [2024-10-13 03:17:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:52,810 INFO L225 Difference]: With dead ends: 155 [2024-10-13 03:17:52,811 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 03:17:52,812 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-10-13 03:17:52,813 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 31 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:52,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 185 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:17:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 03:17:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2024-10-13 03:17:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 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-10-13 03:17:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-10-13 03:17:52,826 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 112 [2024-10-13 03:17:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-10-13 03:17:52,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-13 03:17:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-10-13 03:17:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 03:17:52,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:52,829 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] [2024-10-13 03:17:52,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:17:52,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:52,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 950989028, now seen corresponding path program 1 times [2024-10-13 03:17:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:52,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499510299] [2024-10-13 03:17:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499510299] [2024-10-13 03:17:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499510299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:53,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:53,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:17:53,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4320471] [2024-10-13 03:17:53,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:53,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:17:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:17:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:17:53,173 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-10-13 03:17:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:53,346 INFO L93 Difference]: Finished difference Result 222 states and 331 transitions. [2024-10-13 03:17:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:17:53,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 112 [2024-10-13 03:17:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:53,348 INFO L225 Difference]: With dead ends: 222 [2024-10-13 03:17:53,348 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 03:17:53,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:17:53,350 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 173 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:53,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 162 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:17:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 03:17:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2024-10-13 03:17:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 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-10-13 03:17:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-10-13 03:17:53,375 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 112 [2024-10-13 03:17:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:53,376 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-10-13 03:17:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-10-13 03:17:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-10-13 03:17:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 03:17:53,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:53,381 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] [2024-10-13 03:17:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:17:53,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash 692823590, now seen corresponding path program 1 times [2024-10-13 03:17:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:53,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075972734] [2024-10-13 03:17:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:53,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:53,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075972734] [2024-10-13 03:17:53,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075972734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:53,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:53,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:17:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131087751] [2024-10-13 03:17:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:53,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:17:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:53,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:17:53,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:17:53,814 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-10-13 03:17:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:54,170 INFO L93 Difference]: Finished difference Result 271 states and 399 transitions. [2024-10-13 03:17:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:17:54,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 112 [2024-10-13 03:17:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:54,173 INFO L225 Difference]: With dead ends: 271 [2024-10-13 03:17:54,173 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 03:17:54,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:17:54,175 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 172 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:54,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 359 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:17:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 03:17:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97. [2024-10-13 03:17:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 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-10-13 03:17:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-10-13 03:17:54,188 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 112 [2024-10-13 03:17:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:54,189 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-10-13 03:17:54,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-10-13 03:17:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-10-13 03:17:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 03:17:54,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:54,190 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-10-13 03:17:54,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:17:54,190 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash -789416265, now seen corresponding path program 1 times [2024-10-13 03:17:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735841662] [2024-10-13 03:17:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735841662] [2024-10-13 03:17:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735841662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:54,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:54,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:17:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73026473] [2024-10-13 03:17:54,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:54,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:17:54,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:54,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:17:54,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:17:54,379 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 4 states, 4 states have (on average 9.0) 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-10-13 03:17:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:54,589 INFO L93 Difference]: Finished difference Result 281 states and 407 transitions. [2024-10-13 03:17:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:17:54,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) 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-10-13 03:17:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:54,592 INFO L225 Difference]: With dead ends: 281 [2024-10-13 03:17:54,592 INFO L226 Difference]: Without dead ends: 185 [2024-10-13 03:17:54,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-10-13 03:17:54,596 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 201 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:54,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 95 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:17:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-13 03:17:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 99. [2024-10-13 03:17:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 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-10-13 03:17:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-10-13 03:17:54,624 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 113 [2024-10-13 03:17:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-10-13 03:17:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) 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-10-13 03:17:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-10-13 03:17:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 03:17:54,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:54,625 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-10-13 03:17:54,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:17:54,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:54,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1047581703, now seen corresponding path program 1 times [2024-10-13 03:17:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375841727] [2024-10-13 03:17:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:55,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375841727] [2024-10-13 03:17:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375841727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:55,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:17:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650508095] [2024-10-13 03:17:55,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:55,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:17:55,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:55,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:17:55,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:17:55,038 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10-13 03:17:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:55,709 INFO L93 Difference]: Finished difference Result 458 states and 659 transitions. [2024-10-13 03:17:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 03:17:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10-13 03:17:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:55,713 INFO L225 Difference]: With dead ends: 458 [2024-10-13 03:17:55,713 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 03:17:55,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:17:55,717 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 228 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:55,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 833 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:17:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 03:17:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 215. [2024-10-13 03:17:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 180 states have (on average 1.3722222222222222) internal successors, (247), 180 states have internal predecessors, (247), 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-10-13 03:17:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2024-10-13 03:17:55,744 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 113 [2024-10-13 03:17:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:55,744 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2024-10-13 03:17:55,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10-13 03:17:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2024-10-13 03:17:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 03:17:55,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:55,745 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-10-13 03:17:55,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:17:55,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:55,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash -229933253, now seen corresponding path program 1 times [2024-10-13 03:17:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:55,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209479526] [2024-10-13 03:17:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209479526] [2024-10-13 03:17:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209479526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:17:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546192616] [2024-10-13 03:17:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:17:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:55,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:17:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:17:55,987 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-10-13 03:17:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:56,291 INFO L93 Difference]: Finished difference Result 418 states and 604 transitions. [2024-10-13 03:17:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:17:56,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-10-13 03:17:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:56,295 INFO L225 Difference]: With dead ends: 418 [2024-10-13 03:17:56,296 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 03:17:56,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:17:56,298 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 72 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:56,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 540 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:17:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 03:17:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 228. [2024-10-13 03:17:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 193 states have internal predecessors, (265), 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-10-13 03:17:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 329 transitions. [2024-10-13 03:17:56,343 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 329 transitions. Word has length 113 [2024-10-13 03:17:56,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:56,344 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 329 transitions. [2024-10-13 03:17:56,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-10-13 03:17:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 329 transitions. [2024-10-13 03:17:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 03:17:56,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:56,347 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] [2024-10-13 03:17:56,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:17:56,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:56,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1523740416, now seen corresponding path program 1 times [2024-10-13 03:17:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:56,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792618391] [2024-10-13 03:17:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:56,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792618391] [2024-10-13 03:17:56,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792618391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:56,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:56,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:17:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603823378] [2024-10-13 03:17:56,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:56,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:17:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:56,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:17:56,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:17:56,736 INFO L87 Difference]: Start difference. First operand 228 states and 329 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-10-13 03:17:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:57,235 INFO L93 Difference]: Finished difference Result 561 states and 805 transitions. [2024-10-13 03:17:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:17:57,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 114 [2024-10-13 03:17:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:57,237 INFO L225 Difference]: With dead ends: 561 [2024-10-13 03:17:57,237 INFO L226 Difference]: Without dead ends: 334 [2024-10-13 03:17:57,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 03:17:57,239 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 186 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:57,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 593 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 03:17:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-13 03:17:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 244. [2024-10-13 03:17:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 209 states have internal predecessors, (287), 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-10-13 03:17:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 351 transitions. [2024-10-13 03:17:57,269 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 351 transitions. Word has length 114 [2024-10-13 03:17:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:57,270 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 351 transitions. [2024-10-13 03:17:57,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-10-13 03:17:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 351 transitions. [2024-10-13 03:17:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 03:17:57,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:57,271 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] [2024-10-13 03:17:57,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:17:57,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1263946263, now seen corresponding path program 1 times [2024-10-13 03:17:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053395180] [2024-10-13 03:17:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:57,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053395180] [2024-10-13 03:17:57,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053395180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:57,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:57,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:17:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132099917] [2024-10-13 03:17:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:17:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:17:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:17:57,494 INFO L87 Difference]: Start difference. First operand 244 states and 351 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-10-13 03:17:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:57,749 INFO L93 Difference]: Finished difference Result 505 states and 728 transitions. [2024-10-13 03:17:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:17:57,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 114 [2024-10-13 03:17:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:57,751 INFO L225 Difference]: With dead ends: 505 [2024-10-13 03:17:57,751 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 03:17:57,752 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-10-13 03:17:57,752 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:57,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 327 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:17:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 03:17:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2024-10-13 03:17:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.3578947368421053) internal successors, (258), 190 states have internal predecessors, (258), 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-10-13 03:17:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 322 transitions. [2024-10-13 03:17:57,782 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 322 transitions. Word has length 114 [2024-10-13 03:17:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:57,783 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 322 transitions. [2024-10-13 03:17:57,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-10-13 03:17:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 322 transitions. [2024-10-13 03:17:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 03:17:57,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:57,784 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] [2024-10-13 03:17:57,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:17:57,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:57,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1101038590, now seen corresponding path program 1 times [2024-10-13 03:17:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287357623] [2024-10-13 03:17:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:58,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:58,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287357623] [2024-10-13 03:17:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287357623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:58,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:17:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958247488] [2024-10-13 03:17:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:58,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:17:58,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:17:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:17:58,014 INFO L87 Difference]: Start difference. First operand 225 states and 322 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-10-13 03:17:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:58,262 INFO L93 Difference]: Finished difference Result 430 states and 614 transitions. [2024-10-13 03:17:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:17:58,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 114 [2024-10-13 03:17:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:58,264 INFO L225 Difference]: With dead ends: 430 [2024-10-13 03:17:58,264 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 03:17:58,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:17:58,265 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 64 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:58,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 531 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:17:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 03:17:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 233. [2024-10-13 03:17:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3535353535353536) internal successors, (268), 198 states have internal predecessors, (268), 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-10-13 03:17:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 332 transitions. [2024-10-13 03:17:58,297 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 332 transitions. Word has length 114 [2024-10-13 03:17:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:58,298 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 332 transitions. [2024-10-13 03:17:58,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-10-13 03:17:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 332 transitions. [2024-10-13 03:17:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 03:17:58,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:58,299 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] [2024-10-13 03:17:58,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:17:58,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:58,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1686648089, now seen corresponding path program 1 times [2024-10-13 03:17:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191719138] [2024-10-13 03:17:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:58,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191719138] [2024-10-13 03:17:58,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191719138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:58,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:17:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920856631] [2024-10-13 03:17:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:17:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:17:58,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:17:58,611 INFO L87 Difference]: Start difference. First operand 233 states and 332 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-10-13 03:17:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:58,863 INFO L93 Difference]: Finished difference Result 559 states and 781 transitions. [2024-10-13 03:17:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:17:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 114 [2024-10-13 03:17:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:58,878 INFO L225 Difference]: With dead ends: 559 [2024-10-13 03:17:58,878 INFO L226 Difference]: Without dead ends: 327 [2024-10-13 03:17:58,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:17:58,880 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 77 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:58,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 373 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:17:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-13 03:17:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 238. [2024-10-13 03:17:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2857142857142858) internal successors, (261), 203 states have internal predecessors, (261), 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-10-13 03:17:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 325 transitions. [2024-10-13 03:17:58,923 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 325 transitions. Word has length 114 [2024-10-13 03:17:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:58,924 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 325 transitions. [2024-10-13 03:17:58,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-10-13 03:17:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 325 transitions. [2024-10-13 03:17:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 03:17:58,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:58,925 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] [2024-10-13 03:17:58,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 03:17:58,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:58,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2059431490, now seen corresponding path program 1 times [2024-10-13 03:17:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:58,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785977038] [2024-10-13 03:17:58,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:59,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:59,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785977038] [2024-10-13 03:17:59,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785977038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:59,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:59,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:17:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207824949] [2024-10-13 03:17:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:59,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:17:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:59,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:17:59,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:17:59,010 INFO L87 Difference]: Start difference. First operand 238 states and 325 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 03:17:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:59,085 INFO L93 Difference]: Finished difference Result 601 states and 818 transitions. [2024-10-13 03:17:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:17:59,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 115 [2024-10-13 03:17:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:59,087 INFO L225 Difference]: With dead ends: 601 [2024-10-13 03:17:59,087 INFO L226 Difference]: Without dead ends: 364 [2024-10-13 03:17:59,088 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-10-13 03:17:59,088 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 79 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:59,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 173 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:17:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-13 03:17:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 276. [2024-10-13 03:17:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.2655601659751037) internal successors, (305), 241 states have internal predecessors, (305), 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-10-13 03:17:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 369 transitions. [2024-10-13 03:17:59,119 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 369 transitions. Word has length 115 [2024-10-13 03:17:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:59,119 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 369 transitions. [2024-10-13 03:17:59,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 03:17:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 369 transitions. [2024-10-13 03:17:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 03:17:59,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:59,120 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] [2024-10-13 03:17:59,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 03:17:59,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:59,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1797149783, now seen corresponding path program 1 times [2024-10-13 03:17:59,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:59,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934378191] [2024-10-13 03:17:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:59,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:17:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:17:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:17:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:17:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:17:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:17:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:17:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:17:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:17:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:17:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:17:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:17:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:17:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:17:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:17:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:17:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:17:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:17:59,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:17:59,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934378191] [2024-10-13 03:17:59,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934378191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:17:59,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:17:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:17:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369877142] [2024-10-13 03:17:59,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:17:59,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:17:59,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:17:59,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:17:59,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:17:59,457 INFO L87 Difference]: Start difference. First operand 276 states and 369 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-10-13 03:17:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:17:59,766 INFO L93 Difference]: Finished difference Result 538 states and 703 transitions. [2024-10-13 03:17:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:17:59,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 115 [2024-10-13 03:17:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:17:59,768 INFO L225 Difference]: With dead ends: 538 [2024-10-13 03:17:59,768 INFO L226 Difference]: Without dead ends: 389 [2024-10-13 03:17:59,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-13 03:17:59,769 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 123 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:17:59,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 498 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:17:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-13 03:17:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 280. [2024-10-13 03:17:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 245 states have internal predecessors, (310), 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-10-13 03:17:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 374 transitions. [2024-10-13 03:17:59,809 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 374 transitions. Word has length 115 [2024-10-13 03:17:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:17:59,810 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 374 transitions. [2024-10-13 03:17:59,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-10-13 03:17:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 374 transitions. [2024-10-13 03:17:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 03:17:59,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:17:59,811 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] [2024-10-13 03:17:59,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 03:17:59,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:17:59,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:17:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash -343523732, now seen corresponding path program 1 times [2024-10-13 03:17:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:17:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433212392] [2024-10-13 03:17:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:17:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:17:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:18:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:18:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:18:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:18:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:18:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:18:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:18:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:18:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:18:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:18:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:18:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:18:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:18:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:18:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:18:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:18:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:18:00,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:18:00,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433212392] [2024-10-13 03:18:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433212392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:18:00,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:18:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:18:00,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60038311] [2024-10-13 03:18:00,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:18:00,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:18:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:18:00,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:18:00,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:18:00,070 INFO L87 Difference]: Start difference. First operand 280 states and 374 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-10-13 03:18:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:18:00,312 INFO L93 Difference]: Finished difference Result 515 states and 676 transitions. [2024-10-13 03:18:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:18:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 115 [2024-10-13 03:18:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:18:00,315 INFO L225 Difference]: With dead ends: 515 [2024-10-13 03:18:00,315 INFO L226 Difference]: Without dead ends: 362 [2024-10-13 03:18:00,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:18:00,316 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 43 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:18:00,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 482 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:18:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-13 03:18:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 276. [2024-10-13 03:18:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.2697095435684647) internal successors, (306), 241 states have internal predecessors, (306), 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-10-13 03:18:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 370 transitions. [2024-10-13 03:18:00,344 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 370 transitions. Word has length 115 [2024-10-13 03:18:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:18:00,345 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 370 transitions. [2024-10-13 03:18:00,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-10-13 03:18:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 370 transitions. [2024-10-13 03:18:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 03:18:00,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:18:00,346 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] [2024-10-13 03:18:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 03:18:00,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:18:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:18:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash 871405551, now seen corresponding path program 1 times [2024-10-13 03:18:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:18:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527506972] [2024-10-13 03:18:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:18:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:18:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:18:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:18:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:18:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:18:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:18:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:18:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:18:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:18:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:18:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:18:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:18:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:18:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:18:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:18:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:18:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:18:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:18:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:18:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527506972] [2024-10-13 03:18:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527506972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:18:00,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:18:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:18:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112105140] [2024-10-13 03:18:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:18:00,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:18:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:18:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:18:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:18:00,427 INFO L87 Difference]: Start difference. First operand 276 states and 370 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 03:18:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:18:00,511 INFO L93 Difference]: Finished difference Result 513 states and 693 transitions. [2024-10-13 03:18:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:18:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 115 [2024-10-13 03:18:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:18:00,513 INFO L225 Difference]: With dead ends: 513 [2024-10-13 03:18:00,513 INFO L226 Difference]: Without dead ends: 364 [2024-10-13 03:18:00,514 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-10-13 03:18:00,514 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:18:00,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 225 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:18:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-13 03:18:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 267. [2024-10-13 03:18:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 232 states have (on average 1.2672413793103448) internal successors, (294), 232 states have internal predecessors, (294), 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-10-13 03:18:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 358 transitions. [2024-10-13 03:18:00,544 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 358 transitions. Word has length 115 [2024-10-13 03:18:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:18:00,544 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 358 transitions. [2024-10-13 03:18:00,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 03:18:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2024-10-13 03:18:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 03:18:00,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:18:00,546 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] [2024-10-13 03:18:00,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 03:18:00,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:18:00,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:18:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1816356802, now seen corresponding path program 1 times [2024-10-13 03:18:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:18:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755887318] [2024-10-13 03:18:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:18:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:18:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:18:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:18:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:18:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:18:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:18:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:18:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:18:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 03:18:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:18:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:18:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:18:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 03:18:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 03:18:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 03:18:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 03:18:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 03:18:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:18:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:18:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755887318] [2024-10-13 03:18:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755887318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:18:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:18:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:18:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178676678] [2024-10-13 03:18:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:18:00,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:18:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:18:00,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:18:00,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:18:00,636 INFO L87 Difference]: Start difference. First operand 267 states and 358 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 03:18:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:18:00,747 INFO L93 Difference]: Finished difference Result 619 states and 834 transitions. [2024-10-13 03:18:00,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:18:00,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 115 [2024-10-13 03:18:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:18:00,750 INFO L225 Difference]: With dead ends: 619 [2024-10-13 03:18:00,750 INFO L226 Difference]: Without dead ends: 353 [2024-10-13 03:18:00,751 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-10-13 03:18:00,751 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 72 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:18:00,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 161 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:18:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-13 03:18:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 267. [2024-10-13 03:18:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 232 states have (on average 1.2543103448275863) internal successors, (291), 232 states have internal predecessors, (291), 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-10-13 03:18:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 355 transitions. [2024-10-13 03:18:00,786 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 355 transitions. Word has length 115 [2024-10-13 03:18:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:18:00,786 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 355 transitions. [2024-10-13 03:18:00,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-13 03:18:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 355 transitions. [2024-10-13 03:18:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 03:18:00,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:18:00,788 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] [2024-10-13 03:18:00,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 03:18:00,788 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:18:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:18:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -625070331, now seen corresponding path program 1 times [2024-10-13 03:18:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:18:00,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611760082] [2024-10-13 03:18:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:18:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:18:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:18:00,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:18:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:18:00,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:18:00,883 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:18:00,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:18:00,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 03:18:00,888 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:18:00,976 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:18:00,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:18:00 BoogieIcfgContainer [2024-10-13 03:18:00,979 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:18:00,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:18:00,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:18:00,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:18:00,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:17:51" (3/4) ... [2024-10-13 03:18:00,981 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:18:00,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:18:00,983 INFO L158 Benchmark]: Toolchain (without parser) took 9891.69ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 83.1MB in the beginning and 168.0MB in the end (delta: -84.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2024-10-13 03:18:00,984 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:18:00,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.49ms. Allocated memory is still 148.9MB. Free memory was 82.9MB in the beginning and 112.6MB in the end (delta: -29.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-10-13 03:18:00,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.33ms. Allocated memory is still 148.9MB. Free memory was 112.6MB in the beginning and 109.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:18:00,985 INFO L158 Benchmark]: Boogie Preprocessor took 59.50ms. Allocated memory is still 148.9MB. Free memory was 109.0MB in the beginning and 103.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:18:00,985 INFO L158 Benchmark]: RCFGBuilder took 457.78ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 77.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 03:18:00,985 INFO L158 Benchmark]: TraceAbstraction took 9010.75ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 76.9MB in the beginning and 168.0MB in the end (delta: -91.0MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2024-10-13 03:18:00,986 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 314.6MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:18:00,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.49ms. Allocated memory is still 148.9MB. Free memory was 82.9MB in the beginning and 112.6MB in the end (delta: -29.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.33ms. Allocated memory is still 148.9MB. Free memory was 112.6MB in the beginning and 109.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.50ms. Allocated memory is still 148.9MB. Free memory was 109.0MB in the beginning and 103.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 457.78ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 77.5MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9010.75ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 76.9MB in the beginning and 168.0MB in the end (delta: -91.0MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 314.6MB. Free memory is still 168.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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; [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 [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=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_15=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] 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=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] [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=64, 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=64, 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=64, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, 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=64, var_1_16=-256, 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=62, 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=64, var_1_16=-256, 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=62, 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] var_1_30 = var_1_32 [L63] 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=64, var_1_16=-256, 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=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] 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=64, var_1_16=-256, 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=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] 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=64, var_1_16=-256, 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=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, 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=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] 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=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] 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, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L79] 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, 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=64, var_1_16=-256, var_1_17=505, var_1_1=-2, var_1_22=505, var_1_24=-64, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 17, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1706 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1706 mSDsluCounter, 5629 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3558 mSDsCounter, 404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2454 IncrementalHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 404 mSolverCounterUnsat, 2071 mSDtfsCounter, 2454 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 655 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=13, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1233 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1934 NumberOfCodeBlocks, 1934 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1802 ConstructedInterpolants, 0 QuantifiedInterpolants, 4623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 7680/7680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:18:01,023 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:18:03,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:18:03,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:18:03,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:18:03,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:18:03,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:18:03,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:18:03,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:18:03,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:18:03,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:18:03,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:18:03,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:18:03,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:18:03,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:18:03,129 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:18:03,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:18:03,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:18:03,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:18:03,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:18:03,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:18:03,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:18:03,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:18:03,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:18:03,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:18:03,137 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:18:03,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:18:03,137 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:18:03,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:18:03,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:18:03,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:18:03,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:18:03,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:18:03,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:18:03,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:18:03,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:18:03,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:18:03,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:18:03,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:18:03,140 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:18:03,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:18:03,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:18:03,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:18:03,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:18:03,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:18:03,144 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:18:03,144 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-10-13 03:18:03,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:18:03,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:18:03,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:18:03,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:18:03,443 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:18:03,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-10-13 03:18:04,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:18:05,025 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:18:05,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i [2024-10-13 03:18:05,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9a6ffdf/b7ae132402544af48ab74c988db27a82/FLAGe87573693 [2024-10-13 03:18:05,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a9a6ffdf/b7ae132402544af48ab74c988db27a82 [2024-10-13 03:18:05,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:18:05,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:18:05,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:18:05,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:18:05,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:18:05,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6960d8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05, skipping insertion in model container [2024-10-13 03:18:05,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:18:05,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-10-13 03:18:05,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:18:05,689 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:18:05,700 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-63.i[913,926] [2024-10-13 03:18:05,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:18:05,749 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:18:05,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05 WrapperNode [2024-10-13 03:18:05,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:18:05,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:18:05,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:18:05,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:18:05,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,793 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-10-13 03:18:05,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:18:05,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:18:05,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:18:05,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:18:05,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,826 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-10-13 03:18:05,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:18:05,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:18:05,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:18:05,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:18:05,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (1/1) ... [2024-10-13 03:18:05,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:18:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:18:05,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:18:05,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:18:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:18:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:18:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:18:05,934 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:18:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:18:05,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:18:06,024 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:18:06,026 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:18:10,927 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:18:10,927 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:18:10,966 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:18:10,967 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:18:10,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:10 BoogieIcfgContainer [2024-10-13 03:18:10,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:18:10,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:18:10,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:18:10,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:18:10,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:18:05" (1/3) ... [2024-10-13 03:18:10,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d33f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:18:10, skipping insertion in model container [2024-10-13 03:18:10,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:18:05" (2/3) ... [2024-10-13 03:18:10,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d33f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:18:10, skipping insertion in model container [2024-10-13 03:18:10,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:18:10" (3/3) ... [2024-10-13 03:18:10,977 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-63.i [2024-10-13 03:18:10,993 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:18:10,993 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:18:11,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:18:11,059 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;@7f3f9df2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:18:11,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:18:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 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-10-13 03:18:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 03:18:11,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:18:11,075 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] [2024-10-13 03:18:11,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:18:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:18:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1106764813, now seen corresponding path program 1 times [2024-10-13 03:18:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:18:11,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649260677] [2024-10-13 03:18:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:18:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:18:11,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:18:11,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:18:11,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:18:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:11,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:18:11,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:18:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-13 03:18:11,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:18:11,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:18:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649260677] [2024-10-13 03:18:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649260677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:18:11,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:18:11,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:18:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704340938] [2024-10-13 03:18:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:18:11,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:18:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:18:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:18:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:18:11,530 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-10-13 03:18:13,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:18:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:18:13,952 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-10-13 03:18:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:18:13,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 106 [2024-10-13 03:18:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:18:13,988 INFO L225 Difference]: With dead ends: 101 [2024-10-13 03:18:13,988 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 03:18:13,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:18:13,993 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:18:13,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 03:18:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 03:18:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 03:18:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-10-13 03:18:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-13 03:18:14,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 106 [2024-10-13 03:18:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:18:14,026 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-13 03:18:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-10-13 03:18:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-13 03:18:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 03:18:14,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:18:14,030 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] [2024-10-13 03:18:14,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:18:14,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:18:14,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:18:14,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:18:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1542581721, now seen corresponding path program 1 times [2024-10-13 03:18:14,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:18:14,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920087192] [2024-10-13 03:18:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:18:14,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:18:14,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:18:14,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:18:14,236 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-10-13 03:18:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:14,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:18:14,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:18:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:18:14,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:18:14,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:18:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920087192] [2024-10-13 03:18:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920087192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:18:14,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:18:14,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:18:14,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984003733] [2024-10-13 03:18:14,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:18:14,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:18:14,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:18:14,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:18:14,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:18:14,664 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-13 03:18:17,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:18:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:18:17,863 INFO L93 Difference]: Finished difference Result 113 states and 167 transitions. [2024-10-13 03:18:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:18:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 106 [2024-10-13 03:18:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:18:17,865 INFO L225 Difference]: With dead ends: 113 [2024-10-13 03:18:17,865 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 03:18:17,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-10-13 03:18:17,867 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:18:17,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 131 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 03:18:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 03:18:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2024-10-13 03:18:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 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-10-13 03:18:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-10-13 03:18:17,874 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 106 [2024-10-13 03:18:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:18:17,876 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-10-13 03:18:17,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-13 03:18:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-10-13 03:18:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 03:18:17,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:18:17,877 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] [2024-10-13 03:18:17,892 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-10-13 03:18:18,078 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-10-13 03:18:18,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:18:18,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:18:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1850619289, now seen corresponding path program 1 times [2024-10-13 03:18:18,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:18:18,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637118540] [2024-10-13 03:18:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:18:18,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:18:18,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:18:18,082 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-10-13 03:18:18,091 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-10-13 03:18:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:18:18,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 03:18:18,442 INFO L278 TraceCheckSpWp]: Computing forward predicates...