./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-95.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_fillercode_fillercodesize_ps-cn-50_file-95.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 78b6b6cf5499eab08fe2bc413479a5546b049ee5c089da6fe6410d342c769f91 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:58:03,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:58:03,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:58:03,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:58:03,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:58:03,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:58:03,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:58:03,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:58:03,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:58:03,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:58:03,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:58:03,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:58:03,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:58:03,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:58:03,237 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:58:03,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:58:03,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:58:03,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:58:03,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:58:03,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:58:03,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:58:03,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:58:03,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:58:03,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:58:03,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:58:03,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:58:03,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:58:03,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:58:03,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:58:03,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:58:03,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:58:03,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:58:03,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:58:03,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:58:03,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:58:03,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:58:03,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:58:03,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:58:03,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:58:03,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:58:03,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:58:03,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:58:03,243 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 -> 78b6b6cf5499eab08fe2bc413479a5546b049ee5c089da6fe6410d342c769f91 [2024-11-20 03:58:03,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:58:03,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:58:03,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:58:03,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:58:03,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:58:03,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-95.i [2024-11-20 03:58:04,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:58:04,835 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:58:04,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-95.i [2024-11-20 03:58:04,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccdc2abf1/d1998aa38fed405dafd4d38f1de0d67d/FLAG7f55774da [2024-11-20 03:58:04,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccdc2abf1/d1998aa38fed405dafd4d38f1de0d67d [2024-11-20 03:58:04,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:58:04,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:58:04,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:58:04,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:58:04,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:58:04,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:58:04" (1/1) ... [2024-11-20 03:58:04,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7b501d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:04, skipping insertion in model container [2024-11-20 03:58:04,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:58:04" (1/1) ... [2024-11-20 03:58:04,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:58:05,048 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_ps-cn-50_file-95.i[915,928] [2024-11-20 03:58:05,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:58:05,120 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:58:05,135 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_ps-cn-50_file-95.i[915,928] [2024-11-20 03:58:05,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:58:05,185 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:58:05,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05 WrapperNode [2024-11-20 03:58:05,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:58:05,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:58:05,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:58:05,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:58:05,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,228 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2024-11-20 03:58:05,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:58:05,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:58:05,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:58:05,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:58:05,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,281 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 03:58:05,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:58:05,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:58:05,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:58:05,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:58:05,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (1/1) ... [2024-11-20 03:58:05,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:58:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:58:05,342 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 03:58:05,344 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 03:58:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:58:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:58:05,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:58:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:58:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:58:05,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:58:05,453 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:58:05,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:58:05,859 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 03:58:05,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:58:05,874 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:58:05,874 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:58:05,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:05 BoogieIcfgContainer [2024-11-20 03:58:05,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:58:05,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:58:05,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:58:05,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:58:05,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:58:04" (1/3) ... [2024-11-20 03:58:05,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b38bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:58:05, skipping insertion in model container [2024-11-20 03:58:05,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:58:05" (2/3) ... [2024-11-20 03:58:05,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b38bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:58:05, skipping insertion in model container [2024-11-20 03:58:05,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:58:05" (3/3) ... [2024-11-20 03:58:05,883 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-95.i [2024-11-20 03:58:05,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:58:05,896 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:58:05,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:58:05,968 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;@32377d3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:58:05,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:58:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 76 states have internal predecessors, (106), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 03:58:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-20 03:58:05,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:58:05,989 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:05,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:58:05,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:58:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1815516488, now seen corresponding path program 1 times [2024-11-20 03:58:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:58:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646493347] [2024-11-20 03:58:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:58:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:58:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:58:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:58:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:58:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:58:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:58:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:58:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:58:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:58:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:58:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:58:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:58:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:58:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:58:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:58:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:58:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:58:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:58:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:58:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:58:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:58:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:58:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:58:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:58:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:58:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:58:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 03:58:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:58:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 03:58:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:58:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 03:58:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 03:58:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 03:58:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:58:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 03:58:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:58:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:58:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-20 03:58:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-20 03:58:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-20 03:58:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-20 03:58:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-20 03:58:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-20 03:58:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-20 03:58:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-20 03:58:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-20 03:58:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:58:06,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646493347] [2024-11-20 03:58:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646493347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:58:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:58:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:58:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117279078] [2024-11-20 03:58:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:58:06,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:58:06,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:58:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:58:06,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:58:06,525 INFO L87 Difference]: Start difference. First operand has 122 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 76 states have internal predecessors, (106), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-20 03:58:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:58:06,563 INFO L93 Difference]: Finished difference Result 236 states and 424 transitions. [2024-11-20 03:58:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:58:06,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 273 [2024-11-20 03:58:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:58:06,574 INFO L225 Difference]: With dead ends: 236 [2024-11-20 03:58:06,574 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 03:58:06,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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 03:58:06,580 INFO L432 NwaCegarLoop]: 184 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, 184 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 03:58:06,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:58:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 03:58:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-20 03:58:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 03:58:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 184 transitions. [2024-11-20 03:58:06,628 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 184 transitions. Word has length 273 [2024-11-20 03:58:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:58:06,629 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 184 transitions. [2024-11-20 03:58:06,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-20 03:58:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 184 transitions. [2024-11-20 03:58:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-20 03:58:06,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:58:06,633 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:06,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:58:06,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:58:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:58:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1239601216, now seen corresponding path program 1 times [2024-11-20 03:58:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:58:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860574459] [2024-11-20 03:58:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:58:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:58:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:58:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:58:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:58:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:58:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:58:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:58:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:58:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:58:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:58:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:58:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:58:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:58:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:58:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:58:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:58:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:58:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:58:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:58:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:58:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:58:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:58:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:58:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:58:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:58:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:58:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 03:58:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:58:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 03:58:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:58:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-20 03:58:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 03:58:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-20 03:58:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:58:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 03:58:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:58:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:58:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-20 03:58:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-20 03:58:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-20 03:58:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-20 03:58:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-20 03:58:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-20 03:58:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-20 03:58:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-20 03:58:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:58:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-11-20 03:58:07,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:58:07,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860574459] [2024-11-20 03:58:07,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860574459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:58:07,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:58:07,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:58:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505670207] [2024-11-20 03:58:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:58:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:58:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:58:07,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:58:07,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:58:07,337 INFO L87 Difference]: Start difference. First operand 117 states and 184 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-20 03:58:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:58:07,621 INFO L93 Difference]: Finished difference Result 346 states and 547 transitions. [2024-11-20 03:58:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:58:07,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 273 [2024-11-20 03:58:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:58:07,627 INFO L225 Difference]: With dead ends: 346 [2024-11-20 03:58:07,627 INFO L226 Difference]: Without dead ends: 232 [2024-11-20 03:58:07,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:58:07,631 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 123 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:58:07,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 498 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:58:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-20 03:58:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2024-11-20 03:58:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 123 states have (on average 1.3414634146341464) internal successors, (165), 123 states have internal predecessors, (165), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 03:58:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 341 transitions. [2024-11-20 03:58:07,670 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 341 transitions. Word has length 273 [2024-11-20 03:58:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:58:07,672 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 341 transitions. [2024-11-20 03:58:07,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-20 03:58:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 341 transitions. [2024-11-20 03:58:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-20 03:58:07,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:58:07,677 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:07,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:58:07,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:58:07,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:58:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1940665794, now seen corresponding path program 1 times [2024-11-20 03:58:07,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:58:07,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209179999] [2024-11-20 03:58:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:58:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:58:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat