./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_codestructure_normal_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_codestructure_normal_file-45.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 b04daa3a7e8844e4d56075df37e5bd4af9f49c0c48ae0d64cf929342abfd9773 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:28:09,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:28:09,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:28:09,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:28:09,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:28:09,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:28:09,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:28:09,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:28:09,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:28:09,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:28:09,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:28:09,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:28:09,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:28:09,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:28:09,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:28:09,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:28:09,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:28:09,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:28:09,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:28:09,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:28:09,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:28:09,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:28:09,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:28:09,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:28:09,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:28:09,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:28:09,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:28:09,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:28:09,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:28:09,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:28:09,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:28:09,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:28:09,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:28:09,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:28:09,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:28:09,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:28:09,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:28:09,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:28:09,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:28:09,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:28:09,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:28:09,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:28:09,565 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 -> b04daa3a7e8844e4d56075df37e5bd4af9f49c0c48ae0d64cf929342abfd9773 [2024-11-20 02:28:09,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:28:09,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:28:09,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:28:09,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:28:09,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:28:09,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-45.i [2024-11-20 02:28:11,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:28:11,563 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:28:11,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-45.i [2024-11-20 02:28:11,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8b3d5f6/10933fcc83374fc1b7afeaad32752721/FLAG3eb07ff2d [2024-11-20 02:28:11,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8b3d5f6/10933fcc83374fc1b7afeaad32752721 [2024-11-20 02:28:11,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:28:11,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:28:11,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:28:11,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:28:11,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:28:11,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:11,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b53b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11, skipping insertion in model container [2024-11-20 02:28:11,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:11,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:28:11,808 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_codestructure_normal_file-45.i[913,926] [2024-11-20 02:28:11,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:28:11,902 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:28:11,914 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_codestructure_normal_file-45.i[913,926] [2024-11-20 02:28:11,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:28:11,970 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:28:11,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11 WrapperNode [2024-11-20 02:28:11,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:28:11,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:28:11,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:28:11,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:28:11,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:11,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,027 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-20 02:28:12,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:28:12,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:28:12,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:28:12,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:28:12,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,066 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-20 02:28:12,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:28:12,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:28:12,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:28:12,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:28:12,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (1/1) ... [2024-11-20 02:28:12,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:28:12,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:28:12,136 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-20 02:28:12,143 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-20 02:28:12,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:28:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:28:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:28:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:28:12,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:28:12,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:28:12,271 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:28:12,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:28:12,611 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:28:12,612 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:28:12,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:28:12,631 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:28:12,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:28:12 BoogieIcfgContainer [2024-11-20 02:28:12,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:28:12,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:28:12,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:28:12,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:28:12,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:28:11" (1/3) ... [2024-11-20 02:28:12,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcba2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:28:12, skipping insertion in model container [2024-11-20 02:28:12,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:11" (2/3) ... [2024-11-20 02:28:12,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcba2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:28:12, skipping insertion in model container [2024-11-20 02:28:12,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:28:12" (3/3) ... [2024-11-20 02:28:12,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-45.i [2024-11-20 02:28:12,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:28:12,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:28:12,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:28:12,734 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;@731f126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:28:12,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:28:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:28:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 02:28:12,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:12,752 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:12,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:12,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1387814542, now seen corresponding path program 1 times [2024-11-20 02:28:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:28:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854338841] [2024-11-20 02:28:12,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:28:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:28:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:28:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:28:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:28:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:28:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:28:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:28:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:28:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:28:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:28:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:28:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:28:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:28:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:28:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:28:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:28:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:28:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:28:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:28:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:28:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:28:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:28:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854338841] [2024-11-20 02:28:13,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854338841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:28:13,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:28:13,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:28:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138975250] [2024-11-20 02:28:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:28:13,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:28:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:28:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:28:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:28:13,318 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:28:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:28:13,343 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-11-20 02:28:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:28:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-20 02:28:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:28:13,355 INFO L225 Difference]: With dead ends: 115 [2024-11-20 02:28:13,356 INFO L226 Difference]: Without dead ends: 57 [2024-11-20 02:28:13,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:28:13,366 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:28:13,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:28:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-20 02:28:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-20 02:28:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:28:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-11-20 02:28:13,415 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 127 [2024-11-20 02:28:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:28:13,417 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-11-20 02:28:13,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:28:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-11-20 02:28:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 02:28:13,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:13,421 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:13,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:28:13,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1064683150, now seen corresponding path program 1 times [2024-11-20 02:28:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:28:13,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91931454] [2024-11-20 02:28:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:28:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:28:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:28:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:28:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:28:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:28:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:28:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:28:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:28:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:28:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:28:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:28:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:28:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:28:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:28:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:28:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:28:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:28:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:28:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:28:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:28:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:28:13,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:28:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91931454] [2024-11-20 02:28:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91931454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:28:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:28:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:28:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549660123] [2024-11-20 02:28:13,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:28:13,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:28:13,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:28:13,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:28:13,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:28:13,778 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:28:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:28:13,836 INFO L93 Difference]: Finished difference Result 127 states and 191 transitions. [2024-11-20 02:28:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:28:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-20 02:28:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:28:13,840 INFO L225 Difference]: With dead ends: 127 [2024-11-20 02:28:13,840 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 02:28:13,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:28:13,843 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:28:13,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 163 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:28:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 02:28:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2024-11-20 02:28:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:28:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2024-11-20 02:28:13,863 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 127 [2024-11-20 02:28:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:28:13,866 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2024-11-20 02:28:13,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:28:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2024-11-20 02:28:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 02:28:13,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:13,869 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:13,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:28:13,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:13,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash 712087644, now seen corresponding path program 1 times [2024-11-20 02:28:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:28:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977189088] [2024-11-20 02:28:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:28:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat