./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.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_fillercodestructure_filler-pe-co_file-59.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 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:26:32,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:26:33,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:26:33,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:26:33,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:26:33,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:26:33,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:26:33,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:26:33,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:26:33,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:26:33,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:26:33,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:26:33,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:26:33,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:26:33,086 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:26:33,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:26:33,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:26:33,087 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:26:33,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:26:33,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:26:33,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:26:33,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:26:33,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:26:33,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:26:33,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:26:33,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:26:33,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:26:33,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:26:33,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:26:33,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:26:33,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:26:33,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:26:33,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:26:33,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:26:33,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:26:33,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:26:33,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:26:33,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:26:33,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:26:33,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:26:33,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:26:33,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:26:33,099 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 -> 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b [2024-11-20 04:26:33,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:26:33,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:26:33,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:26:33,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:26:33,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:26:33,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-11-20 04:26:34,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:26:35,065 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:26:35,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-11-20 04:26:35,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3eb6297/3efdfcd74cea40578d0a20d095e3111b/FLAG6ad4644da [2024-11-20 04:26:35,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3eb6297/3efdfcd74cea40578d0a20d095e3111b [2024-11-20 04:26:35,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:26:35,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:26:35,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:26:35,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:26:35,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:26:35,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382c6056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35, skipping insertion in model container [2024-11-20 04:26:35,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:26:35,326 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_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-11-20 04:26:35,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:26:35,421 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:26:35,433 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_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-11-20 04:26:35,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:26:35,487 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:26:35,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35 WrapperNode [2024-11-20 04:26:35,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:26:35,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:26:35,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:26:35,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:26:35,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,574 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-11-20 04:26:35,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:26:35,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:26:35,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:26:35,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:26:35,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,617 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 04:26:35,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:26:35,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:26:35,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:26:35,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:26:35,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (1/1) ... [2024-11-20 04:26:35,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:26:35,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:26:35,693 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 04:26:35,696 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 04:26:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:26:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:26:35,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:26:35,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:26:35,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:26:35,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:26:35,844 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:26:35,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:26:36,388 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 04:26:36,388 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:26:36,411 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:26:36,412 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:26:36,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:26:36 BoogieIcfgContainer [2024-11-20 04:26:36,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:26:36,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:26:36,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:26:36,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:26:36,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:26:35" (1/3) ... [2024-11-20 04:26:36,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3d50e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:26:36, skipping insertion in model container [2024-11-20 04:26:36,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:26:35" (2/3) ... [2024-11-20 04:26:36,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3d50e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:26:36, skipping insertion in model container [2024-11-20 04:26:36,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:26:36" (3/3) ... [2024-11-20 04:26:36,424 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-11-20 04:26:36,443 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:26:36,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:26:36,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:26:36,515 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;@7d252d25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:26:36,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:26:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 04:26:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 04:26:36,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:26:36,538 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:36,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:26:36,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:26:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 430846258, now seen corresponding path program 1 times [2024-11-20 04:26:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:26:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606983163] [2024-11-20 04:26:36,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:36,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:26:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:26:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:26:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:26:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:26:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:26:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:26:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:26:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:26:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:26:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:26:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:26:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:26:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:26:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:26:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:26:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:26:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:26:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:26:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:26:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:26:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:26:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:26:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:26:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:26:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:26:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:26:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:26:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-20 04:26:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:26:37,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606983163] [2024-11-20 04:26:37,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606983163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:26:37,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:26:37,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:26:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210294832] [2024-11-20 04:26:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:26:37,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:26:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:26:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:26:37,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:26:37,177 INFO L87 Difference]: Start difference. First operand has 91 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-20 04:26:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:26:37,214 INFO L93 Difference]: Finished difference Result 175 states and 313 transitions. [2024-11-20 04:26:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:26:37,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2024-11-20 04:26:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:26:37,229 INFO L225 Difference]: With dead ends: 175 [2024-11-20 04:26:37,229 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 04:26:37,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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 04:26:37,241 INFO L432 NwaCegarLoop]: 137 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, 137 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 04:26:37,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:26:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 04:26:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 04:26:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 04:26:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2024-11-20 04:26:37,314 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 174 [2024-11-20 04:26:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:26:37,315 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2024-11-20 04:26:37,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-20 04:26:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2024-11-20 04:26:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 04:26:37,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:26:37,319 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:37,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:26:37,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:26:37,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:26:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1449271428, now seen corresponding path program 1 times [2024-11-20 04:26:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:26:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693604293] [2024-11-20 04:26:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:26:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:26:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:26:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:26:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:26:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:26:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:26:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:26:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:26:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:26:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:26:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:26:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:26:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:26:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:26:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:26:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:26:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:26:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:26:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:26:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:26:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:26:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:26:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:26:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:26:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:26:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:26:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:26:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-20 04:26:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:26:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693604293] [2024-11-20 04:26:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693604293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:26:38,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:26:38,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:26:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023124241] [2024-11-20 04:26:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:26:38,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:26:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:26:38,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:26:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:26:38,100 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:26:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:26:38,355 INFO L93 Difference]: Finished difference Result 256 states and 406 transitions. [2024-11-20 04:26:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:26:38,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-20 04:26:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:26:38,363 INFO L225 Difference]: With dead ends: 256 [2024-11-20 04:26:38,364 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 04:26:38,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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 04:26:38,367 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 89 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:26:38,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 393 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:26:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 04:26:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2024-11-20 04:26:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 04:26:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2024-11-20 04:26:38,423 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 174 [2024-11-20 04:26:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:26:38,424 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2024-11-20 04:26:38,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:26:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2024-11-20 04:26:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 04:26:38,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:26:38,431 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:38,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:26:38,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:26:38,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:26:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 587320315, now seen corresponding path program 1 times [2024-11-20 04:26:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:26:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227916608] [2024-11-20 04:26:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:26:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:26:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:26:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:26:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:26:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:26:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:26:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:26:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:26:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:26:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:26:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:26:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:26:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:26:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:26:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:26:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:26:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:26:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:26:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:26:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:26:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:26:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:26:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:26:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:26:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:26:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:26:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:26:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-20 04:26:38,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:26:38,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227916608] [2024-11-20 04:26:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227916608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:26:38,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:26:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:26:38,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137015652] [2024-11-20 04:26:38,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:26:38,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:26:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:26:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:26:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:26:38,916 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:26:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:26:39,119 INFO L93 Difference]: Finished difference Result 331 states and 523 transitions. [2024-11-20 04:26:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:26:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-20 04:26:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:26:39,124 INFO L225 Difference]: With dead ends: 331 [2024-11-20 04:26:39,126 INFO L226 Difference]: Without dead ends: 247 [2024-11-20 04:26:39,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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 04:26:39,129 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 136 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:26:39,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 425 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:26:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-20 04:26:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2024-11-20 04:26:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-20 04:26:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 342 transitions. [2024-11-20 04:26:39,192 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 342 transitions. Word has length 175 [2024-11-20 04:26:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:26:39,193 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 342 transitions. [2024-11-20 04:26:39,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:26:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 342 transitions. [2024-11-20 04:26:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-20 04:26:39,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:26:39,198 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:39,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:26:39,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:26:39,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:26:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash -628243053, now seen corresponding path program 1 times [2024-11-20 04:26:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:26:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651308036] [2024-11-20 04:26:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:26:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:26:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:26:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:26:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:26:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:26:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:26:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:26:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:26:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:26:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:26:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:26:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:26:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:26:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:26:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:26:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:26:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:26:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:26:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:26:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:26:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:26:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:26:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:26:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:26:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:26:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:26:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:26:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-20 04:26:39,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:26:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651308036] [2024-11-20 04:26:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651308036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:26:39,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:26:39,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 04:26:39,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687766521] [2024-11-20 04:26:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:26:39,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:26:39,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:26:39,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:26:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:26:39,745 INFO L87 Difference]: Start difference. First operand 217 states and 342 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:26:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:26:40,280 INFO L93 Difference]: Finished difference Result 545 states and 864 transitions. [2024-11-20 04:26:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:26:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-11-20 04:26:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:26:40,286 INFO L225 Difference]: With dead ends: 545 [2024-11-20 04:26:40,286 INFO L226 Difference]: Without dead ends: 379 [2024-11-20 04:26:40,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:26:40,288 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 274 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:26:40,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 231 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 04:26:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-20 04:26:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 247. [2024-11-20 04:26:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 162 states have internal predecessors, (230), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-20 04:26:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 392 transitions. [2024-11-20 04:26:40,344 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 392 transitions. Word has length 176 [2024-11-20 04:26:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:26:40,345 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 392 transitions. [2024-11-20 04:26:40,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:26:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 392 transitions. [2024-11-20 04:26:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-20 04:26:40,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:26:40,347 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:40,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:26:40,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:26:40,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:26:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1891716881, now seen corresponding path program 1 times [2024-11-20 04:26:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:26:40,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274542822] [2024-11-20 04:26:40,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:26:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:26:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:26:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:26:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:26:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:26:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:26:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:26:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:26:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:26:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:26:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:26:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:26:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:26:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:26:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:26:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:26:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:26:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:26:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:26:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:26:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:26:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:26:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:26:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:26:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:26:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:26:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:26:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-20 04:26:40,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:26:40,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274542822] [2024-11-20 04:26:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274542822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:26:40,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922586099] [2024-11-20 04:26:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:40,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:26:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:26:40,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:26:40,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 04:26:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:41,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 04:26:41,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:26:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 222 proven. 72 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-20 04:26:41,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:26:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-20 04:26:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922586099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:26:41,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:26:41,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-20 04:26:41,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870335769] [2024-11-20 04:26:41,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:26:41,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 04:26:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:26:41,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 04:26:41,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:26:41,843 INFO L87 Difference]: Start difference. First operand 247 states and 392 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-20 04:26:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:26:42,195 INFO L93 Difference]: Finished difference Result 465 states and 726 transitions. [2024-11-20 04:26:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 04:26:42,196 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 176 [2024-11-20 04:26:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:26:42,198 INFO L225 Difference]: With dead ends: 465 [2024-11-20 04:26:42,199 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 04:26:42,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2024-11-20 04:26:42,200 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 173 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:26:42,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 259 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:26:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 04:26:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 229. [2024-11-20 04:26:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-20 04:26:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 347 transitions. [2024-11-20 04:26:42,247 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 347 transitions. Word has length 176 [2024-11-20 04:26:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:26:42,250 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 347 transitions. [2024-11-20 04:26:42,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-20 04:26:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 347 transitions. [2024-11-20 04:26:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 04:26:42,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:26:42,252 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:42,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 04:26:42,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:26:42,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:26:42,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:26:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1768251680, now seen corresponding path program 1 times [2024-11-20 04:26:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:26:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715328389] [2024-11-20 04:26:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:26:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:26:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:26:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 04:26:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:26:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 04:26:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:26:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 04:26:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:26:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:26:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 04:26:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 04:26:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:26:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:26:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:26:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:26:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:26:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:26:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:26:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:26:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:26:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 04:26:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:26:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 04:26:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 04:26:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 04:26:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 04:26:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 04:26:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-20 04:26:43,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:26:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715328389] [2024-11-20 04:26:43,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715328389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:26:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099618070] [2024-11-20 04:26:43,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:43,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:26:43,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:26:43,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:26:43,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:26:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:43,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 04:26:43,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:26:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-20 04:26:44,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:26:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-20 04:26:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099618070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:26:44,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:26:44,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2024-11-20 04:26:44,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557926020] [2024-11-20 04:26:44,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:26:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 04:26:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:26:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 04:26:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-20 04:26:44,965 INFO L87 Difference]: Start difference. First operand 229 states and 347 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2024-11-20 04:26:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:26:46,342 INFO L93 Difference]: Finished difference Result 572 states and 856 transitions. [2024-11-20 04:26:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 04:26:46,343 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) Word has length 179 [2024-11-20 04:26:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:26:46,346 INFO L225 Difference]: With dead ends: 572 [2024-11-20 04:26:46,346 INFO L226 Difference]: Without dead ends: 398 [2024-11-20 04:26:46,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=1255, Unknown=0, NotChecked=0, Total=1640 [2024-11-20 04:26:46,349 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 820 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 04:26:46,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 735 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 04:26:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-20 04:26:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 241. [2024-11-20 04:26:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 150 states have (on average 1.28) internal successors, (192), 150 states have internal predecessors, (192), 81 states have call successors, (81), 9 states have call predecessors, (81), 9 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-20 04:26:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 354 transitions. [2024-11-20 04:26:46,402 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 354 transitions. Word has length 179 [2024-11-20 04:26:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:26:46,403 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 354 transitions. [2024-11-20 04:26:46,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2024-11-20 04:26:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 354 transitions. [2024-11-20 04:26:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 04:26:46,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:26:46,406 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:46,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 04:26:46,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 04:26:46,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:26:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:26:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1634238174, now seen corresponding path program 1 times [2024-11-20 04:26:46,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:26:46,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141682103] [2024-11-20 04:26:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:26:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:26:46,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127201733] [2024-11-20 04:26:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:26:46,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:26:46,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:26:46,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:26:46,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 04:26:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:26:46,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 04:26:46,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:26:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-20 04:26:49,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:27:16,219 WARN L286 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-20 04:27:25,410 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-20 04:27:25,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:27:25,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141682103] [2024-11-20 04:27:25,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-20 04:27:25,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 04:27:25,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127201733] [2024-11-20 04:27:25,413 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-20 04:27:25,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:27:25,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:27:25,614 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-20 04:27:25,618 INFO L158 Benchmark]: Toolchain (without parser) took 50524.32ms. Allocated memory was 163.6MB in the beginning and 337.6MB in the end (delta: 174.1MB). Free memory was 107.3MB in the beginning and 167.1MB in the end (delta: -59.8MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2024-11-20 04:27:25,619 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 124.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:27:25,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.47ms. Allocated memory is still 163.6MB. Free memory was 106.8MB in the beginning and 89.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:27:25,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.92ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 84.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 04:27:25,619 INFO L158 Benchmark]: Boogie Preprocessor took 76.68ms. Allocated memory is still 163.6MB. Free memory was 84.2MB in the beginning and 76.7MB in the end (delta: 7.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:27:25,620 INFO L158 Benchmark]: RCFGBuilder took 759.76ms. Allocated memory was 163.6MB in the beginning and 232.8MB in the end (delta: 69.2MB). Free memory was 76.7MB in the beginning and 181.8MB in the end (delta: -105.2MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-20 04:27:25,620 INFO L158 Benchmark]: TraceAbstraction took 49202.63ms. Allocated memory was 232.8MB in the beginning and 337.6MB in the end (delta: 104.9MB). Free memory was 181.8MB in the beginning and 167.1MB in the end (delta: 14.8MB). Peak memory consumption was 119.6MB. Max. memory is 16.1GB. [2024-11-20 04:27:25,621 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 124.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.47ms. Allocated memory is still 163.6MB. Free memory was 106.8MB in the beginning and 89.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.92ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 84.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.68ms. Allocated memory is still 163.6MB. Free memory was 84.2MB in the beginning and 76.7MB in the end (delta: 7.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 759.76ms. Allocated memory was 163.6MB in the beginning and 232.8MB in the end (delta: 69.2MB). Free memory was 76.7MB in the beginning and 181.8MB in the end (delta: -105.2MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 49202.63ms. Allocated memory was 232.8MB in the beginning and 337.6MB in the end (delta: 104.9MB). Free memory was 181.8MB in the beginning and 167.1MB in the end (delta: 14.8MB). Peak memory consumption was 119.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:27:27,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:27:27,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:27:27,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:27:27,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:27:27,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:27:27,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:27:27,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:27:27,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:27:27,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:27:27,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:27:27,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:27:27,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:27:27,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:27:27,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:27:27,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:27:27,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:27:27,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:27:27,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:27:27,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:27:27,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:27:27,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:27:27,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:27:27,853 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:27:27,854 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:27:27,854 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:27:27,854 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:27:27,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:27:27,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:27:27,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:27:27,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:27:27,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:27:27,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:27:27,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:27:27,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:27:27,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:27:27,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:27:27,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:27:27,857 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:27:27,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:27:27,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:27:27,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:27:27,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:27:27,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:27:27,860 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 -> 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b [2024-11-20 04:27:28,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:27:28,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:27:28,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:27:28,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:27:28,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:27:28,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-11-20 04:27:29,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:27:29,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:27:29,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-11-20 04:27:30,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0d4edd3/ff66d91773274e5aaa59d98ad07e7d10/FLAG8d1a1e3c9 [2024-11-20 04:27:30,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0d4edd3/ff66d91773274e5aaa59d98ad07e7d10 [2024-11-20 04:27:30,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:27:30,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:27:30,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:27:30,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:27:30,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:27:30,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60035ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30, skipping insertion in model container [2024-11-20 04:27:30,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:27:30,279 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_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-11-20 04:27:30,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:27:30,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:27:30,404 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_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-11-20 04:27:30,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:27:30,476 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:27:30,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30 WrapperNode [2024-11-20 04:27:30,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:27:30,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:27:30,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:27:30,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:27:30,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,554 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-20 04:27:30,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:27:30,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:27:30,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:27:30,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:27:30,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,602 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 04:27:30,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:27:30,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:27:30,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:27:30,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:27:30,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (1/1) ... [2024-11-20 04:27:30,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:27:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:27:30,681 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 04:27:30,685 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 04:27:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:27:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:27:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:27:30,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:27:30,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:27:30,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:27:30,821 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:27:30,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:27:31,740 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 04:27:31,740 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:27:31,759 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:27:31,759 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:27:31,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:27:31 BoogieIcfgContainer [2024-11-20 04:27:31,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:27:31,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:27:31,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:27:31,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:27:31,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:27:30" (1/3) ... [2024-11-20 04:27:31,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3871cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:27:31, skipping insertion in model container [2024-11-20 04:27:31,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:27:30" (2/3) ... [2024-11-20 04:27:31,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3871cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:27:31, skipping insertion in model container [2024-11-20 04:27:31,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:27:31" (3/3) ... [2024-11-20 04:27:31,771 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-11-20 04:27:31,785 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:27:31,785 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:27:31,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:27:31,857 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;@60ce30fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:27:31,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:27:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 04:27:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 04:27:31,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:27:31,882 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:31,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:27:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:27:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -812112034, now seen corresponding path program 1 times [2024-11-20 04:27:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:27:31,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202944112] [2024-11-20 04:27:31,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:27:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:27:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:27:31,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:27:31,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 04:27:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:27:32,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:27:32,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:27:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-20 04:27:32,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:27:32,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:27:32,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202944112] [2024-11-20 04:27:32,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202944112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:27:32,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:27:32,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:27:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207821696] [2024-11-20 04:27:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:27:32,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:27:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:27:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:27:32,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:27:32,388 INFO L87 Difference]: Start difference. First operand has 84 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-20 04:27:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:27:32,423 INFO L93 Difference]: Finished difference Result 161 states and 289 transitions. [2024-11-20 04:27:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:27:32,426 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2024-11-20 04:27:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:27:32,436 INFO L225 Difference]: With dead ends: 161 [2024-11-20 04:27:32,437 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 04:27:32,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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 04:27:32,446 INFO L432 NwaCegarLoop]: 126 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, 126 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 04:27:32,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:27:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 04:27:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 04:27:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 04:27:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2024-11-20 04:27:32,491 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 172 [2024-11-20 04:27:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:27:32,492 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2024-11-20 04:27:32,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-20 04:27:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2024-11-20 04:27:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-20 04:27:32,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:27:32,496 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:32,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 04:27:32,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:27:32,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:27:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:27:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1666375720, now seen corresponding path program 1 times [2024-11-20 04:27:32,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:27:32,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351358949] [2024-11-20 04:27:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:27:32,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:27:32,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:27:32,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:27:32,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 04:27:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:27:33,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 04:27:33,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:27:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-20 04:27:33,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:27:33,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:27:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351358949] [2024-11-20 04:27:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351358949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:27:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:27:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:27:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410735085] [2024-11-20 04:27:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:27:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:27:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:27:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:27:33,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:27:33,515 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:27:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:27:34,173 INFO L93 Difference]: Finished difference Result 235 states and 373 transitions. [2024-11-20 04:27:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:27:34,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-11-20 04:27:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:27:34,188 INFO L225 Difference]: With dead ends: 235 [2024-11-20 04:27:34,189 INFO L226 Difference]: Without dead ends: 158 [2024-11-20 04:27:34,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 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 04:27:34,191 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:27:34,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 360 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 04:27:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-20 04:27:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2024-11-20 04:27:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 04:27:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 200 transitions. [2024-11-20 04:27:34,239 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 200 transitions. Word has length 172 [2024-11-20 04:27:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:27:34,241 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 200 transitions. [2024-11-20 04:27:34,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:27:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 200 transitions. [2024-11-20 04:27:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 04:27:34,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:27:34,245 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:34,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 04:27:34,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:27:34,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:27:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:27:34,448 INFO L85 PathProgramCache]: Analyzing trace with hash 953809193, now seen corresponding path program 1 times [2024-11-20 04:27:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:27:34,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577012544] [2024-11-20 04:27:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:27:34,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:27:34,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:27:34,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:27:34,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 04:27:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:27:34,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 04:27:34,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:27:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-20 04:27:35,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:27:35,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:27:35,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577012544] [2024-11-20 04:27:35,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577012544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:27:35,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:27:35,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:27:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152336255] [2024-11-20 04:27:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:27:35,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:27:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:27:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:27:35,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:27:35,163 INFO L87 Difference]: Start difference. First operand 128 states and 200 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:27:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:27:36,093 INFO L93 Difference]: Finished difference Result 303 states and 479 transitions. [2024-11-20 04:27:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:27:36,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-20 04:27:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:27:36,107 INFO L225 Difference]: With dead ends: 303 [2024-11-20 04:27:36,107 INFO L226 Difference]: Without dead ends: 226 [2024-11-20 04:27:36,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 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 04:27:36,109 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 111 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 04:27:36,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 381 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 04:27:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-20 04:27:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 203. [2024-11-20 04:27:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 118 states have internal predecessors, (158), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-20 04:27:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 320 transitions. [2024-11-20 04:27:36,165 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 320 transitions. Word has length 173 [2024-11-20 04:27:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:27:36,169 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 320 transitions. [2024-11-20 04:27:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-20 04:27:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 320 transitions. [2024-11-20 04:27:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 04:27:36,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:27:36,176 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:36,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:27:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:27:36,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:27:36,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:27:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 48658495, now seen corresponding path program 1 times [2024-11-20 04:27:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:27:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234159998] [2024-11-20 04:27:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:27:36,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:27:36,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:27:36,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:27:36,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 04:27:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:27:36,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-20 04:27:36,650 INFO L278 TraceCheckSpWp]: Computing forward predicates...