./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.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 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:32:52,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:32:52,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:32:52,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:32:52,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:32:52,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:32:52,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:32:52,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:32:52,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:32:52,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:32:52,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:32:52,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:32:52,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:32:52,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:32:52,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:32:52,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:32:52,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:32:52,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:32:52,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:32:52,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:32:52,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:32:52,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:32:52,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:32:52,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:32:52,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:32:52,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:32:52,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:32:52,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:32:52,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:32:52,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:32:52,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:32:52,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:32:52,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:32:52,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:32:52,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:32:52,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:32:52,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:32:52,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:32:52,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:32:52,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:32:52,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:32:52,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:32:52,343 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 -> 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 [2024-11-12 01:32:52,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:32:52,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:32:52,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:32:52,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:32:52,603 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:32:52,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i [2024-11-12 01:32:54,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:32:54,211 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:32:54,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i [2024-11-12 01:32:54,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fc95fff/a593394c55114911adc060d4dffb8c34/FLAGd60d8edd0 [2024-11-12 01:32:54,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fc95fff/a593394c55114911adc060d4dffb8c34 [2024-11-12 01:32:54,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:32:54,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:32:54,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:32:54,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:32:54,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:32:54,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718aae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54, skipping insertion in model container [2024-11-12 01:32:54,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:32:54,418 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i[913,926] [2024-11-12 01:32:54,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:32:54,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:32:54,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i[913,926] [2024-11-12 01:32:54,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:32:54,532 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:32:54,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54 WrapperNode [2024-11-12 01:32:54,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:32:54,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:32:54,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:32:54,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:32:54,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,583 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-12 01:32:54,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:32:54,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:32:54,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:32:54,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:32:54,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:32:54,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:32:54,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:32:54,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:32:54,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:32:54,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (1/1) ... [2024-11-12 01:32:54,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:32:54,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:32:54,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:32:54,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:32:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:32:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:32:54,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:32:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:32:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:32:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:32:54,808 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:32:54,810 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:32:55,155 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-12 01:32:55,155 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:32:55,171 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:32:55,171 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:32:55,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:32:55 BoogieIcfgContainer [2024-11-12 01:32:55,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:32:55,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:32:55,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:32:55,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:32:55,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:32:54" (1/3) ... [2024-11-12 01:32:55,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab82e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:32:55, skipping insertion in model container [2024-11-12 01:32:55,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:32:54" (2/3) ... [2024-11-12 01:32:55,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab82e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:32:55, skipping insertion in model container [2024-11-12 01:32:55,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:32:55" (3/3) ... [2024-11-12 01:32:55,180 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-10.i [2024-11-12 01:32:55,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:32:55,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:32:55,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:32:55,305 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;@593d988a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:32:55,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:32:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 01:32:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 01:32:55,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:32:55,323 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:32:55,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:32:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:32:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1915142532, now seen corresponding path program 1 times [2024-11-12 01:32:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:32:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046384342] [2024-11-12 01:32:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:32:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:32:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:32:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:32:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:32:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:32:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:32:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:32:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:32:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:32:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:32:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:32:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:32:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:32:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:32:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:32:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:32:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:32:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:32:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:32:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:32:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 01:32:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:32:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046384342] [2024-11-12 01:32:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046384342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:32:56,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:32:56,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:32:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581556733] [2024-11-12 01:32:56,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:32:56,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:32:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:32:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:32:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:32:56,228 INFO L87 Difference]: Start difference. First operand has 74 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 01:32:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:32:56,453 INFO L93 Difference]: Finished difference Result 209 states and 357 transitions. [2024-11-12 01:32:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:32:56,456 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-12 01:32:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:32:56,466 INFO L225 Difference]: With dead ends: 209 [2024-11-12 01:32:56,467 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 01:32:56,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:32:56,474 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:32:56,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 384 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:32:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 01:32:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2024-11-12 01:32:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 01:32:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2024-11-12 01:32:56,531 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 122 [2024-11-12 01:32:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:32:56,532 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2024-11-12 01:32:56,533 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 01:32:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2024-11-12 01:32:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 01:32:56,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:32:56,536 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:32:56,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:32:56,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:32:56,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:32:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2009744545, now seen corresponding path program 1 times [2024-11-12 01:32:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:32:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346035305] [2024-11-12 01:32:56,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:32:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:32:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:33:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:33:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:33:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:33:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:33:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:33:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:33:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:33:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:33:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:33:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:33:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:33:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:33:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:33:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:33:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:33:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:33:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:33:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:33:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 01:33:12,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:33:12,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346035305] [2024-11-12 01:33:12,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346035305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:33:12,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:33:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 01:33:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557085196] [2024-11-12 01:33:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:33:12,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:33:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:33:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:33:12,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:33:12,322 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 01:33:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:33:13,915 INFO L93 Difference]: Finished difference Result 341 states and 493 transitions. [2024-11-12 01:33:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 01:33:13,916 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-11-12 01:33:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:33:13,921 INFO L225 Difference]: With dead ends: 341 [2024-11-12 01:33:13,923 INFO L226 Difference]: Without dead ends: 274 [2024-11-12 01:33:13,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-11-12 01:33:13,927 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 666 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:33:13,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 562 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 01:33:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-12 01:33:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 187. [2024-11-12 01:33:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.296875) internal successors, (166), 129 states have internal predecessors, (166), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:33:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-12 01:33:13,968 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 123 [2024-11-12 01:33:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:33:13,969 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-12 01:33:13,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 01:33:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-12 01:33:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 01:33:13,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:33:13,972 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:33:13,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:33:13,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:33:13,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:33:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1329686175, now seen corresponding path program 1 times [2024-11-12 01:33:13,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:33:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905316109] [2024-11-12 01:33:13,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:33:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:33:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:34:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:34:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:34:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:34:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:34:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:34:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:34:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:34:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:34:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:34:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:34:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:34:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:34:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:34:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:34:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:34:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:34:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:34:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:34:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 01:34:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:34:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905316109] [2024-11-12 01:34:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905316109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:34:12,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:34:12,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 01:34:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270970953] [2024-11-12 01:34:12,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:34:12,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:34:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:34:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:34:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:34:12,959 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 01:34:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:34:14,424 INFO L93 Difference]: Finished difference Result 343 states and 492 transitions. [2024-11-12 01:34:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 01:34:14,424 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-11-12 01:34:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:34:14,428 INFO L225 Difference]: With dead ends: 343 [2024-11-12 01:34:14,428 INFO L226 Difference]: Without dead ends: 276 [2024-11-12 01:34:14,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-11-12 01:34:14,429 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 499 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 01:34:14,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 528 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 01:34:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-12 01:34:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 187. [2024-11-12 01:34:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.296875) internal successors, (166), 129 states have internal predecessors, (166), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:34:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-12 01:34:14,453 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 123 [2024-11-12 01:34:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:34:14,453 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-12 01:34:14,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 01:34:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-12 01:34:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 01:34:14,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:34:14,455 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:34:14,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:34:14,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:34:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:34:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1137097311, now seen corresponding path program 1 times [2024-11-12 01:34:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:34:14,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838094143] [2024-11-12 01:34:14,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:34:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:34:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat