./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_floatingpointinfluence_no-floats_file-82.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_floatingpointinfluence_no-floats_file-82.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 ac500415e5d2e9d3fb881d4fbfbb2b334efa6f0be9649c96e889d794785b3706 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:41:02,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:41:02,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:41:02,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:41:02,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:41:03,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:41:03,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:41:03,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:41:03,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:41:03,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:41:03,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:41:03,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:41:03,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:41:03,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:41:03,021 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:41:03,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:41:03,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:41:03,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:41:03,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:41:03,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:41:03,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:41:03,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:41:03,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:41:03,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:41:03,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:41:03,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:41:03,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:41:03,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:41:03,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:41:03,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:41:03,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:41:03,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:41:03,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:03,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:41:03,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:41:03,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:41:03,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:41:03,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:41:03,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:41:03,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:41:03,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:41:03,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:41:03,033 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 -> ac500415e5d2e9d3fb881d4fbfbb2b334efa6f0be9649c96e889d794785b3706 [2024-10-13 03:41:03,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:41:03,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:41:03,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:41:03,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:41:03,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:41:03,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-82.i [2024-10-13 03:41:04,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:41:04,976 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:41:04,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-82.i [2024-10-13 03:41:04,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3c96542/163551f70b9d40f4966b3ba104518e2c/FLAG0c173e8ec [2024-10-13 03:41:05,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3c96542/163551f70b9d40f4966b3ba104518e2c [2024-10-13 03:41:05,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:41:05,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:41:05,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:05,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:41:05,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:41:05,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70544194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05, skipping insertion in model container [2024-10-13 03:41:05,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:41:05,228 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_floatingpointinfluence_no-floats_file-82.i[916,929] [2024-10-13 03:41:05,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:05,317 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:41:05,332 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_floatingpointinfluence_no-floats_file-82.i[916,929] [2024-10-13 03:41:05,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:05,392 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:41:05,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05 WrapperNode [2024-10-13 03:41:05,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:05,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:05,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:41:05,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:41:05,402 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:41:05" (1/1) ... [2024-10-13 03:41:05,415 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:41:05" (1/1) ... [2024-10-13 03:41:05,465 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-10-13 03:41:05,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:05,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:41:05,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:41:05,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:41:05,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,514 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:41:05,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:41:05,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:41:05,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:41:05,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:41:05,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (1/1) ... [2024-10-13 03:41:05,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:05,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:41:05,583 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:41:05,587 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:41:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:41:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:41:05,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:41:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:41:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:41:05,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:41:05,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:41:05,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:41:06,024 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:41:06,024 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:41:06,072 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:41:06,072 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:41:06,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:06 BoogieIcfgContainer [2024-10-13 03:41:06,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:41:06,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:41:06,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:41:06,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:41:06,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:41:05" (1/3) ... [2024-10-13 03:41:06,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dd76ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:06, skipping insertion in model container [2024-10-13 03:41:06,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:05" (2/3) ... [2024-10-13 03:41:06,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dd76ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:06, skipping insertion in model container [2024-10-13 03:41:06,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:06" (3/3) ... [2024-10-13 03:41:06,081 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-82.i [2024-10-13 03:41:06,094 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:41:06,095 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:41:06,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:41:06,173 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;@236b15f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:41:06,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:41:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 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:41:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 03:41:06,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:06,195 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] [2024-10-13 03:41:06,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2070977204, now seen corresponding path program 1 times [2024-10-13 03:41:06,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:06,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900209146] [2024-10-13 03:41:06,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:06,626 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:41:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900209146] [2024-10-13 03:41:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900209146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:06,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:06,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:41:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115448948] [2024-10-13 03:41:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:06,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:41:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:41:06,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:41:06,671 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:41:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:06,720 INFO L93 Difference]: Finished difference Result 105 states and 180 transitions. [2024-10-13 03:41:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:41:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 101 [2024-10-13 03:41:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:06,733 INFO L225 Difference]: With dead ends: 105 [2024-10-13 03:41:06,733 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 03:41:06,738 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:41:06,742 INFO L432 NwaCegarLoop]: 75 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, 75 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:41:06,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:41:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 03:41:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 03:41:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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:41:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2024-10-13 03:41:06,795 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 101 [2024-10-13 03:41:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:06,797 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-10-13 03:41:06,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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:41:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-10-13 03:41:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 03:41:06,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:06,802 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] [2024-10-13 03:41:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:41:06,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:06,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1704049332, now seen corresponding path program 1 times [2024-10-13 03:41:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228715123] [2024-10-13 03:41:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,231 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:41:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228715123] [2024-10-13 03:41:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228715123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:41:07,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587768980] [2024-10-13 03:41:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:07,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:41:07,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:07,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:41:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:41:07,237 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:41:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:07,316 INFO L93 Difference]: Finished difference Result 119 states and 177 transitions. [2024-10-13 03:41:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:41:07,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 101 [2024-10-13 03:41:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:07,322 INFO L225 Difference]: With dead ends: 119 [2024-10-13 03:41:07,322 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 03:41:07,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:41:07,325 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:07,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 206 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:41:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 03:41:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2024-10-13 03:41:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 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:41:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-10-13 03:41:07,345 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 101 [2024-10-13 03:41:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:07,349 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-10-13 03:41:07,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:41:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-10-13 03:41:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:41:07,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:07,352 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] [2024-10-13 03:41:07,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:41:07,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:07,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1712394959, now seen corresponding path program 1 times [2024-10-13 03:41:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:07,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788535143] [2024-10-13 03:41:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:07,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:41:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:41:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:41:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:41:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:41:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:41:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:41:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:41:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:41:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:41:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:41:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:41:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:41:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:07,872 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:41:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788535143] [2024-10-13 03:41:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788535143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:41:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619657376] [2024-10-13 03:41:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:07,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:41:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:07,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:41:07,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:41:07,878 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:41:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:08,146 INFO L93 Difference]: Finished difference Result 178 states and 261 transitions. [2024-10-13 03:41:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:41:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 103 [2024-10-13 03:41:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:08,149 INFO L225 Difference]: With dead ends: 178 [2024-10-13 03:41:08,149 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 03:41:08,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:41:08,151 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:08,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 268 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:41:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 03:41:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2024-10-13 03:41:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 78 states have internal predecessors, (102), 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:41:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2024-10-13 03:41:08,182 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 103 [2024-10-13 03:41:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2024-10-13 03:41:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:41:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2024-10-13 03:41:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 03:41:08,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:08,186 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] [2024-10-13 03:41:08,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:41:08,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:08,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1011330381, now seen corresponding path program 1 times [2024-10-13 03:41:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471333582] [2024-10-13 03:41:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat