./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_loopvsstraightlinecode_50-1loop_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_loopvsstraightlinecode_50-1loop_file-4.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 c6e6c091665e8e4f771bb3cd8e0481d9eed629558679af30005e00c3a586ea10 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:47:52,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:47:52,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:47:52,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:47:52,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:47:52,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:47:52,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:47:52,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:47:52,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:47:52,307 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:47:52,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:47:52,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:47:52,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:47:52,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:47:52,310 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:47:52,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:47:52,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:47:52,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:47:52,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:47:52,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:47:52,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:47:52,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:47:52,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:47:52,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:47:52,316 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:47:52,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:47:52,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:47:52,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:47:52,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:47:52,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:47:52,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:47:52,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:47:52,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:47:52,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:47:52,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:47:52,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:47:52,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:47:52,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:47:52,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:47:52,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:47:52,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:47:52,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:47:52,319 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 -> c6e6c091665e8e4f771bb3cd8e0481d9eed629558679af30005e00c3a586ea10 [2024-10-24 09:47:52,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:47:52,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:47:52,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:47:52,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:47:52,538 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:47:52,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i [2024-10-24 09:47:53,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:47:53,972 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:47:53,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i [2024-10-24 09:47:53,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65adda132/d8a0fce1868e4fc882b3680773a50033/FLAGa8ca1a534 [2024-10-24 09:47:53,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65adda132/d8a0fce1868e4fc882b3680773a50033 [2024-10-24 09:47:53,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:47:53,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:47:53,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:47:53,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:47:54,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:47:54,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:47:53" (1/1) ... [2024-10-24 09:47:54,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d1e995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54, skipping insertion in model container [2024-10-24 09:47:54,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:47:53" (1/1) ... [2024-10-24 09:47:54,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:47:54,188 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i[914,927] [2024-10-24 09:47:54,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:47:54,265 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:47:54,274 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i[914,927] [2024-10-24 09:47:54,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:47:54,318 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:47:54,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54 WrapperNode [2024-10-24 09:47:54,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:47:54,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:47:54,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:47:54,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:47:54,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,359 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-10-24 09:47:54,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:47:54,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:47:54,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:47:54,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:47:54,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,399 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:47:54,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:47:54,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:47:54,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:47:54,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:47:54,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (1/1) ... [2024-10-24 09:47:54,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:47:54,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:47:54,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:47:54,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:47:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:47:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:47:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:47:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:47:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:47:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:47:54,566 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:47:54,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:47:54,863 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 09:47:54,864 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:47:54,904 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:47:54,904 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:47:54,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:47:54 BoogieIcfgContainer [2024-10-24 09:47:54,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:47:54,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:47:54,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:47:54,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:47:54,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:47:53" (1/3) ... [2024-10-24 09:47:54,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19eeec4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:47:54, skipping insertion in model container [2024-10-24 09:47:54,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:47:54" (2/3) ... [2024-10-24 09:47:54,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19eeec4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:47:54, skipping insertion in model container [2024-10-24 09:47:54,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:47:54" (3/3) ... [2024-10-24 09:47:54,913 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-4.i [2024-10-24 09:47:54,926 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:47:54,926 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:47:54,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:47:54,978 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;@771aef10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:47:54,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:47:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:47:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:47:54,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:47:55,000 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:47:55,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:47:55,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:47:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1615965193, now seen corresponding path program 1 times [2024-10-24 09:47:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:47:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573166665] [2024-10-24 09:47:55,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:47:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:47:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:47:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:47:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:47:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:47:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:47:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:47:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:47:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:47:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:47:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:47:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:47:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:47:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:47:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:47:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:47:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:47:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:47:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:47:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:47:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:47:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:47:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:47:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573166665] [2024-10-24 09:47:55,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573166665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:47:55,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:47:55,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:47:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742976211] [2024-10-24 09:47:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:47:55,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:47:55,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:47:55,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:47:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:47:55,418 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:47:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:47:55,457 INFO L93 Difference]: Finished difference Result 115 states and 201 transitions. [2024-10-24 09:47:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:47:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-10-24 09:47:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:47:55,467 INFO L225 Difference]: With dead ends: 115 [2024-10-24 09:47:55,467 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 09:47:55,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:47:55,474 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:47:55,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:47:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 09:47:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 09:47:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:47:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-24 09:47:55,509 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-24 09:47:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:47:55,510 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-24 09:47:55,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:47:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-24 09:47:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:47:55,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:47:55,513 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:47:55,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:47:55,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:47:55,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:47:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash -116990407, now seen corresponding path program 1 times [2024-10-24 09:47:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:47:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471428477] [2024-10-24 09:47:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:47:55,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:47:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:47:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:47:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:47:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:47:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:47:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:47:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:47:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:47:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:47:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:47:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:47:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:47:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:47:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:47:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:47:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:47:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:47:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:47:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:47:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:47:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:47:56,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:47:56,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471428477] [2024-10-24 09:47:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471428477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:47:56,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:47:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:47:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416632024] [2024-10-24 09:47:56,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:47:56,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:47:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:47:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:47:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:47:56,214 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:47:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:47:56,295 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2024-10-24 09:47:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:47:56,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 09:47:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:47:56,300 INFO L225 Difference]: With dead ends: 166 [2024-10-24 09:47:56,300 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 09:47:56,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:47:56,302 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:47:56,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 159 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:47:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 09:47:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-24 09:47:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:47:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2024-10-24 09:47:56,342 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 126 [2024-10-24 09:47:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:47:56,345 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2024-10-24 09:47:56,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:47:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2024-10-24 09:47:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:47:56,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:47:56,347 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:47:56,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:47:56,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:47:56,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:47:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash -818054985, now seen corresponding path program 1 times [2024-10-24 09:47:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:47:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247319073] [2024-10-24 09:47:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:47:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:47:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:47:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:47:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:47:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:47:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:47:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:47:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:47:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:47:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:47:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:47:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:47:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:47:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:47:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:47:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:47:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:47:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:47:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:47:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:47:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:47:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:47:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:47:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:47:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247319073] [2024-10-24 09:47:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247319073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:47:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:47:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:47:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139510806] [2024-10-24 09:47:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:47:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:47:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:47:56,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:47:56,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:47:56,912 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:47:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:47:57,238 INFO L93 Difference]: Finished difference Result 348 states and 527 transitions. [2024-10-24 09:47:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:47:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 09:47:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:47:57,242 INFO L225 Difference]: With dead ends: 348 [2024-10-24 09:47:57,244 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 09:47:57,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:47:57,246 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 108 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:47:57,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 403 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:47:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 09:47:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 218. [2024-10-24 09:47:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 133 states have internal predecessors, (172), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 09:47:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 332 transitions. [2024-10-24 09:47:57,269 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 332 transitions. Word has length 126 [2024-10-24 09:47:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:47:57,269 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 332 transitions. [2024-10-24 09:47:57,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:47:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 332 transitions. [2024-10-24 09:47:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:47:57,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:47:57,271 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:47:57,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:47:57,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:47:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:47:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -817995403, now seen corresponding path program 1 times [2024-10-24 09:47:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:47:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474996237] [2024-10-24 09:47:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:47:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:47:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:48:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474996237] [2024-10-24 09:48:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474996237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 09:48:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585651621] [2024-10-24 09:48:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:01,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 09:48:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 09:48:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:48:01,084 INFO L87 Difference]: Start difference. First operand 218 states and 332 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:01,860 INFO L93 Difference]: Finished difference Result 602 states and 900 transitions. [2024-10-24 09:48:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 09:48:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 09:48:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:01,865 INFO L225 Difference]: With dead ends: 602 [2024-10-24 09:48:01,866 INFO L226 Difference]: Without dead ends: 385 [2024-10-24 09:48:01,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:48:01,869 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 143 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:01,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 359 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 09:48:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-24 09:48:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 292. [2024-10-24 09:48:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.281081081081081) internal successors, (237), 185 states have internal predecessors, (237), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 09:48:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 437 transitions. [2024-10-24 09:48:01,927 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 437 transitions. Word has length 126 [2024-10-24 09:48:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:01,927 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 437 transitions. [2024-10-24 09:48:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 437 transitions. [2024-10-24 09:48:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:01,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:01,929 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:01,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:48:01,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:01,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash -657423375, now seen corresponding path program 1 times [2024-10-24 09:48:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:01,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427414688] [2024-10-24 09:48:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:48:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427414688] [2024-10-24 09:48:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427414688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:02,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:02,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:48:02,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627292859] [2024-10-24 09:48:02,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:02,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:48:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:48:02,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:48:02,135 INFO L87 Difference]: Start difference. First operand 292 states and 437 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:02,290 INFO L93 Difference]: Finished difference Result 511 states and 771 transitions. [2024-10-24 09:48:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:48:02,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 09:48:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:02,293 INFO L225 Difference]: With dead ends: 511 [2024-10-24 09:48:02,293 INFO L226 Difference]: Without dead ends: 399 [2024-10-24 09:48:02,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:48:02,298 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 68 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:02,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 232 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:48:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-24 09:48:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 288. [2024-10-24 09:48:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 181 states have (on average 1.276243093922652) internal successors, (231), 181 states have internal predecessors, (231), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 09:48:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 431 transitions. [2024-10-24 09:48:02,331 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 431 transitions. Word has length 127 [2024-10-24 09:48:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:02,332 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 431 transitions. [2024-10-24 09:48:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2024-10-24 09:48:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:02,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:02,336 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:02,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:48:02,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:02,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:02,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1358487953, now seen corresponding path program 1 times [2024-10-24 09:48:02,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:02,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274363105] [2024-10-24 09:48:02,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:48:02,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:02,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274363105] [2024-10-24 09:48:02,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274363105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:48:02,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870800659] [2024-10-24 09:48:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:48:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:48:02,544 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-10-24 09:48:02,545 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-10-24 09:48:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:02,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:48:02,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-24 09:48:02,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:48:03,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870800659] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:48:03,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:48:03,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 09:48:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536609691] [2024-10-24 09:48:03,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:48:03,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:48:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:48:03,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:48:03,009 INFO L87 Difference]: Start difference. First operand 288 states and 431 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-24 09:48:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:03,161 INFO L93 Difference]: Finished difference Result 539 states and 783 transitions. [2024-10-24 09:48:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:48:03,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 127 [2024-10-24 09:48:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:03,164 INFO L225 Difference]: With dead ends: 539 [2024-10-24 09:48:03,164 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 09:48:03,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:48:03,165 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 77 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:03,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 109 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:48:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 09:48:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 281. [2024-10-24 09:48:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 169 states have internal predecessors, (193), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 09:48:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 393 transitions. [2024-10-24 09:48:03,193 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 393 transitions. Word has length 127 [2024-10-24 09:48:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:03,195 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 393 transitions. [2024-10-24 09:48:03,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-24 09:48:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 393 transitions. [2024-10-24 09:48:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:03,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:03,197 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:03,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:48:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 09:48:03,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 569304566, now seen corresponding path program 1 times [2024-10-24 09:48:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487985422] [2024-10-24 09:48:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:48:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487985422] [2024-10-24 09:48:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487985422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:48:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700818469] [2024-10-24 09:48:03,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:48:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:03,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:48:03,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:48:03,691 INFO L87 Difference]: Start difference. First operand 281 states and 393 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:03,921 INFO L93 Difference]: Finished difference Result 412 states and 576 transitions. [2024-10-24 09:48:03,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:48:03,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 09:48:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:03,924 INFO L225 Difference]: With dead ends: 412 [2024-10-24 09:48:03,924 INFO L226 Difference]: Without dead ends: 188 [2024-10-24 09:48:03,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:48:03,925 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:03,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:48:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-24 09:48:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2024-10-24 09:48:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 102 states have internal predecessors, (116), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:48:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 236 transitions. [2024-10-24 09:48:03,951 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 236 transitions. Word has length 127 [2024-10-24 09:48:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:03,951 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 236 transitions. [2024-10-24 09:48:03,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 236 transitions. [2024-10-24 09:48:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:03,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:03,953 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:03,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 09:48:03,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:03,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash 311139128, now seen corresponding path program 1 times [2024-10-24 09:48:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:03,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586529745] [2024-10-24 09:48:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:48:04,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586529745] [2024-10-24 09:48:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586529745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:48:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724738636] [2024-10-24 09:48:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:04,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:48:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:48:04,186 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-10-24 09:48:04,186 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-10-24 09:48:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:04,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:48:04,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-24 09:48:04,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:48:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724738636] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:48:04,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:48:04,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-24 09:48:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134670856] [2024-10-24 09:48:04,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:48:04,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 09:48:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:04,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 09:48:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:48:04,668 INFO L87 Difference]: Start difference. First operand 170 states and 236 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 09:48:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:05,115 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2024-10-24 09:48:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 09:48:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 127 [2024-10-24 09:48:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:05,119 INFO L225 Difference]: With dead ends: 315 [2024-10-24 09:48:05,119 INFO L226 Difference]: Without dead ends: 202 [2024-10-24 09:48:05,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-24 09:48:05,121 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:05,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 312 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:48:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-24 09:48:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 176. [2024-10-24 09:48:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.1226415094339623) internal successors, (119), 106 states have internal predecessors, (119), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:48:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2024-10-24 09:48:05,147 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 127 [2024-10-24 09:48:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:05,148 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2024-10-24 09:48:05,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 09:48:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2024-10-24 09:48:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:05,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:05,150 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:05,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:48:05,353 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,SelfDestructingSolverStorable7 [2024-10-24 09:48:05,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:05,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash 311198710, now seen corresponding path program 1 times [2024-10-24 09:48:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:05,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896849021] [2024-10-24 09:48:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:05,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:48:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896849021] [2024-10-24 09:48:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896849021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:48:05,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930478101] [2024-10-24 09:48:05,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:05,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:48:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:05,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:48:05,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:48:05,466 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:05,503 INFO L93 Difference]: Finished difference Result 360 states and 490 transitions. [2024-10-24 09:48:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:48:05,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 09:48:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:05,506 INFO L225 Difference]: With dead ends: 360 [2024-10-24 09:48:05,506 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 09:48:05,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:48:05,507 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 70 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:05,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 152 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:48:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 09:48:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-24 09:48:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.1267605633802817) internal successors, (160), 142 states have internal predecessors, (160), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 09:48:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 320 transitions. [2024-10-24 09:48:05,527 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 320 transitions. Word has length 127 [2024-10-24 09:48:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:05,527 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 320 transitions. [2024-10-24 09:48:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2024-10-24 09:48:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:05,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:05,528 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:05,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 09:48:05,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:05,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1416582265, now seen corresponding path program 1 times [2024-10-24 09:48:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:05,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969042689] [2024-10-24 09:48:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:05,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:48:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:05,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969042689] [2024-10-24 09:48:05,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969042689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:05,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:05,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:48:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959494782] [2024-10-24 09:48:05,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:05,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:48:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:48:05,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:48:05,659 INFO L87 Difference]: Start difference. First operand 235 states and 320 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:05,791 INFO L93 Difference]: Finished difference Result 529 states and 722 transitions. [2024-10-24 09:48:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:48:05,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 09:48:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:05,794 INFO L225 Difference]: With dead ends: 529 [2024-10-24 09:48:05,794 INFO L226 Difference]: Without dead ends: 351 [2024-10-24 09:48:05,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:48:05,795 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 82 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:05,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 278 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:48:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-24 09:48:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2024-10-24 09:48:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 208 states have (on average 1.1153846153846154) internal successors, (232), 208 states have internal predecessors, (232), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 09:48:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 472 transitions. [2024-10-24 09:48:05,820 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 472 transitions. Word has length 127 [2024-10-24 09:48:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:05,820 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 472 transitions. [2024-10-24 09:48:05,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 472 transitions. [2024-10-24 09:48:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:05,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:05,822 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:05,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 09:48:05,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:05,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:05,823 INFO L85 PathProgramCache]: Analyzing trace with hash 607235639, now seen corresponding path program 1 times [2024-10-24 09:48:05,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:05,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356933032] [2024-10-24 09:48:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:48:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:48:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:48:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:48:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:48:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:48:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:48:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:48:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:48:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:48:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:48:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:48:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:48:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:48:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:48:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:48:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:48:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:48:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:48:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:48:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:48:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:48:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356933032] [2024-10-24 09:48:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356933032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:48:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767784369] [2024-10-24 09:48:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:06,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:48:06,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:48:06,505 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-10-24 09:48:06,506 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-10-24 09:48:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:06,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 09:48:06,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 400 proven. 60 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-24 09:48:07,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 63 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-24 09:48:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767784369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:48:08,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:48:08,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 27 [2024-10-24 09:48:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298805777] [2024-10-24 09:48:08,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:48:08,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-24 09:48:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:48:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-24 09:48:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2024-10-24 09:48:08,194 INFO L87 Difference]: Start difference. First operand 347 states and 472 transitions. Second operand has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 25 states have internal predecessors, (88), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-24 09:48:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:09,580 INFO L93 Difference]: Finished difference Result 473 states and 622 transitions. [2024-10-24 09:48:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-24 09:48:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 25 states have internal predecessors, (88), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 127 [2024-10-24 09:48:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:09,583 INFO L225 Difference]: With dead ends: 473 [2024-10-24 09:48:09,583 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 09:48:09,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=2177, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 09:48:09,585 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 337 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:09,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 332 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 09:48:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 09:48:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 125. [2024-10-24 09:48:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:48:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2024-10-24 09:48:09,617 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 127 [2024-10-24 09:48:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:09,618 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2024-10-24 09:48:09,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 25 states have internal predecessors, (88), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-24 09:48:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2024-10-24 09:48:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 09:48:09,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:09,619 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:09,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 09:48:09,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:48:09,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2061861400, now seen corresponding path program 1 times [2024-10-24 09:48:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:48:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276799994] [2024-10-24 09:48:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:48:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:48:09,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150691613] [2024-10-24 09:48:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:48:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:48:09,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:48:09,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 09:48:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:48:10,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:48:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:48:10,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:48:10,128 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:48:10,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:48:10,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 09:48:10,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:48:10,334 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:10,401 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:48:10,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:48:10 BoogieIcfgContainer [2024-10-24 09:48:10,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:48:10,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:48:10,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:48:10,404 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:48:10,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:47:54" (3/4) ... [2024-10-24 09:48:10,408 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:48:10,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:48:10,409 INFO L158 Benchmark]: Toolchain (without parser) took 16413.22ms. Allocated memory was 174.1MB in the beginning and 526.4MB in the end (delta: 352.3MB). Free memory was 102.5MB in the beginning and 370.8MB in the end (delta: -268.3MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2024-10-24 09:48:10,409 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:48:10,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.40ms. Allocated memory is still 174.1MB. Free memory was 102.3MB in the beginning and 86.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 09:48:10,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.83ms. Allocated memory is still 174.1MB. Free memory was 86.9MB in the beginning and 83.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:48:10,410 INFO L158 Benchmark]: Boogie Preprocessor took 58.13ms. Allocated memory is still 174.1MB. Free memory was 83.9MB in the beginning and 141.9MB in the end (delta: -57.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-24 09:48:10,410 INFO L158 Benchmark]: RCFGBuilder took 485.39ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 116.3MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 09:48:10,412 INFO L158 Benchmark]: TraceAbstraction took 15497.30ms. Allocated memory was 174.1MB in the beginning and 526.4MB in the end (delta: 352.3MB). Free memory was 115.5MB in the beginning and 370.8MB in the end (delta: -255.4MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2024-10-24 09:48:10,412 INFO L158 Benchmark]: Witness Printer took 5.38ms. Allocated memory is still 526.4MB. Free memory is still 370.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:48:10,413 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.20ms. Allocated memory is still 174.1MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.40ms. Allocated memory is still 174.1MB. Free memory was 102.3MB in the beginning and 86.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.83ms. Allocated memory is still 174.1MB. Free memory was 86.9MB in the beginning and 83.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.13ms. Allocated memory is still 174.1MB. Free memory was 83.9MB in the beginning and 141.9MB in the end (delta: -57.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 485.39ms. Allocated memory is still 174.1MB. Free memory was 141.5MB in the beginning and 116.3MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15497.30ms. Allocated memory was 174.1MB in the beginning and 526.4MB in the end (delta: 352.3MB). Free memory was 115.5MB in the beginning and 370.8MB in the end (delta: -255.4MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. * Witness Printer took 5.38ms. Allocated memory is still 526.4MB. Free memory is still 370.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] unsigned short int last_1_var_1_6 = 4; [L40] unsigned short int last_1_var_1_9 = 4; [L41] unsigned long int last_1_var_1_14 = 500; [L42] signed short int last_1_var_1_17 = 16; [L135] isInitial = 1 [L136] FCALL initially() [L137] int k_loop; [L138] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] COND TRUE k_loop < 1 [L139] CALL updateLastVariables() [L125] last_1_var_1_6 = var_1_6 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_14 = var_1_14 [L128] last_1_var_1_17 = var_1_17 [L139] RET updateLastVariables() [L140] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L111] var_1_19 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] var_1_20 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] var_1_21 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET updateVariables() [L141] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L47] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L52] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L53] COND TRUE last_1_var_1_14 >= stepLocal_3 [L54] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L56] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L57] COND TRUE (- var_1_14) > var_1_6 [L58] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] unsigned char stepLocal_2 = var_1_4; [L64] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=7516192750, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L65] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=7516192750, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND TRUE stepLocal_1 >= var_1_6 [L69] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L74] unsigned char stepLocal_5 = var_1_1; [L75] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L76] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L83] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L84] COND TRUE ! var_1_1 [L85] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L141] RET step() [L142] CALL, EXPR property() [L131-L132] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=7516192750, var_1_15=2147483647, var_1_16=7516192766, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1063 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1059 mSDsluCounter, 2658 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1681 mSDsCounter, 560 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1913 IncrementalHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 560 mSolverCounterUnsat, 977 mSDtfsCounter, 1913 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1339 GetRequests, 1223 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 364 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2029 NumberOfCodeBlocks, 2029 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 10703 SizeOfPredicates, 15 NumberOfNonLiveVariables, 918 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 12458/12920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:48:10,468 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 0 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_loopvsstraightlinecode_50-1loop_file-4.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 c6e6c091665e8e4f771bb3cd8e0481d9eed629558679af30005e00c3a586ea10 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:48:12,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:48:12,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:48:12,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:48:12,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:48:12,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:48:12,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:48:12,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:48:12,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:48:12,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:48:12,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:48:12,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:48:12,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:48:12,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:48:12,522 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:48:12,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:48:12,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:48:12,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:48:12,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:48:12,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:48:12,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:48:12,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:48:12,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:48:12,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:48:12,527 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:48:12,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:48:12,527 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:48:12,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:48:12,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:48:12,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:48:12,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:48:12,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:48:12,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:48:12,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:48:12,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:48:12,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:48:12,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:48:12,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:48:12,530 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:48:12,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:48:12,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:48:12,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:48:12,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:48:12,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:48:12,531 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:48:12,531 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 -> c6e6c091665e8e4f771bb3cd8e0481d9eed629558679af30005e00c3a586ea10 [2024-10-24 09:48:12,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:48:12,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:48:12,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:48:12,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:48:12,839 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:48:12,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i [2024-10-24 09:48:14,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:48:14,288 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:48:14,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i [2024-10-24 09:48:14,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ecae9a56/c5b56b643c784445b04f241d6032b17e/FLAGcd8195e0f [2024-10-24 09:48:14,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ecae9a56/c5b56b643c784445b04f241d6032b17e [2024-10-24 09:48:14,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:48:14,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:48:14,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:48:14,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:48:14,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:48:14,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:14,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46bc6f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14, skipping insertion in model container [2024-10-24 09:48:14,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:14,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:48:14,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i[914,927] [2024-10-24 09:48:14,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:48:14,919 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:48:14,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-4.i[914,927] [2024-10-24 09:48:14,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:48:14,960 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:48:14,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14 WrapperNode [2024-10-24 09:48:14,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:48:14,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:48:14,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:48:14,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:48:14,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:14,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,002 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-10-24 09:48:15,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:48:15,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:48:15,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:48:15,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:48:15,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,045 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:48:15,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:48:15,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:48:15,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:48:15,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:48:15,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (1/1) ... [2024-10-24 09:48:15,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:48:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:48:15,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:48:15,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:48:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:48:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:48:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:48:15,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:48:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:48:15,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:48:15,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:48:15,219 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:48:15,984 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 09:48:15,984 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:48:16,048 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:48:16,049 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:48:16,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:48:16 BoogieIcfgContainer [2024-10-24 09:48:16,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:48:16,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:48:16,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:48:16,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:48:16,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:48:14" (1/3) ... [2024-10-24 09:48:16,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a92359e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:48:16, skipping insertion in model container [2024-10-24 09:48:16,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:48:14" (2/3) ... [2024-10-24 09:48:16,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a92359e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:48:16, skipping insertion in model container [2024-10-24 09:48:16,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:48:16" (3/3) ... [2024-10-24 09:48:16,058 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-4.i [2024-10-24 09:48:16,073 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:48:16,073 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:48:16,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:48:16,143 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;@1f0a05be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:48:16,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:48:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:48:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:48:16,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:16,159 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:16,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:16,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1615965193, now seen corresponding path program 1 times [2024-10-24 09:48:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:16,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120920916] [2024-10-24 09:48:16,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:16,178 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-10-24 09:48:16,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:16,181 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-10-24 09:48:16,182 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-10-24 09:48:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:16,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:48:16,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-24 09:48:16,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:48:16,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:48:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120920916] [2024-10-24 09:48:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120920916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:48:16,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623439823] [2024-10-24 09:48:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:16,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:48:16,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:48:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:48:16,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:48:16,467 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:16,662 INFO L93 Difference]: Finished difference Result 115 states and 201 transitions. [2024-10-24 09:48:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:48:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-24 09:48:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:16,670 INFO L225 Difference]: With dead ends: 115 [2024-10-24 09:48:16,670 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 09:48:16,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:48:16,676 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:16,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:48:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 09:48:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 09:48:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:48:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-24 09:48:16,709 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-24 09:48:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:16,709 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-24 09:48:16,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-24 09:48:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:48:16,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:16,711 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:16,719 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-10-24 09:48:16,912 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-10-24 09:48:16,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:16,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash -116990407, now seen corresponding path program 1 times [2024-10-24 09:48:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:16,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414294192] [2024-10-24 09:48:16,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:16,914 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-10-24 09:48:16,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:16,917 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-10-24 09:48:16,921 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-10-24 09:48:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:17,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:48:17,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:48:18,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:48:18,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:48:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414294192] [2024-10-24 09:48:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414294192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:18,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:18,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:48:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673731530] [2024-10-24 09:48:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:18,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:48:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:48:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:48:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:48:18,073 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:19,036 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2024-10-24 09:48:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:48:19,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 09:48:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:19,039 INFO L225 Difference]: With dead ends: 167 [2024-10-24 09:48:19,039 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 09:48:19,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 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-10-24 09:48:19,040 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:19,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 255 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 09:48:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 09:48:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2024-10-24 09:48:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:48:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-24 09:48:19,059 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 126 [2024-10-24 09:48:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:19,059 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-24 09:48:19,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-24 09:48:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:48:19,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:19,061 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:19,069 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:48:19,261 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-10-24 09:48:19,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:19,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash -818054985, now seen corresponding path program 1 times [2024-10-24 09:48:19,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:19,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438635220] [2024-10-24 09:48:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:19,263 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-10-24 09:48:19,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:19,266 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-10-24 09:48:19,267 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-10-24 09:48:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:19,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:48:19,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-10-24 09:48:20,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-24 09:48:20,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:48:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438635220] [2024-10-24 09:48:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438635220] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:48:20,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:48:20,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-24 09:48:20,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573709901] [2024-10-24 09:48:20,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:48:20,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 09:48:20,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:48:20,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 09:48:20,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-24 09:48:20,658 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-24 09:48:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:21,931 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2024-10-24 09:48:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 09:48:21,933 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 126 [2024-10-24 09:48:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:21,937 INFO L225 Difference]: With dead ends: 191 [2024-10-24 09:48:21,937 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 09:48:21,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-24 09:48:21,939 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 42 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:21,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 179 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 09:48:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 09:48:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2024-10-24 09:48:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:48:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 155 transitions. [2024-10-24 09:48:21,963 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 155 transitions. Word has length 126 [2024-10-24 09:48:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:21,963 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 155 transitions. [2024-10-24 09:48:21,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-24 09:48:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 155 transitions. [2024-10-24 09:48:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:21,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:21,966 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:21,975 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 (4)] Ended with exit code 0 [2024-10-24 09:48:22,166 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-10-24 09:48:22,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -81887882, now seen corresponding path program 1 times [2024-10-24 09:48:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:22,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715444522] [2024-10-24 09:48:22,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:22,168 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-10-24 09:48:22,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:22,172 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-10-24 09:48:22,173 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-10-24 09:48:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:22,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:48:22,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-24 09:48:22,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:48:22,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:48:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715444522] [2024-10-24 09:48:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715444522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:48:22,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:48:22,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-24 09:48:22,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339969758] [2024-10-24 09:48:22,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:48:22,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:48:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:48:22,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:48:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:48:22,768 INFO L87 Difference]: Start difference. First operand 115 states and 155 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 09:48:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:24,007 INFO L93 Difference]: Finished difference Result 256 states and 340 transitions. [2024-10-24 09:48:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 09:48:24,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 127 [2024-10-24 09:48:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:24,010 INFO L225 Difference]: With dead ends: 256 [2024-10-24 09:48:24,010 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 09:48:24,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-10-24 09:48:24,012 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:24,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 310 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 09:48:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 09:48:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2024-10-24 09:48:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.101010101010101) internal successors, (109), 99 states have internal predecessors, (109), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:48:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 229 transitions. [2024-10-24 09:48:24,034 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 229 transitions. Word has length 127 [2024-10-24 09:48:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:24,035 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 229 transitions. [2024-10-24 09:48:24,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 09:48:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 229 transitions. [2024-10-24 09:48:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:24,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:24,036 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:24,044 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 09:48:24,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-10-24 09:48:24,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:24,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash -81828300, now seen corresponding path program 1 times [2024-10-24 09:48:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:24,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370623996] [2024-10-24 09:48:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:24,238 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-10-24 09:48:24,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:24,240 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-24 09:48:24,242 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 (6)] Waiting until timeout for monitored process [2024-10-24 09:48:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:24,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:48:24,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-24 09:48:24,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 09:48:25,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:48:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370623996] [2024-10-24 09:48:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370623996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:48:25,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:48:25,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2024-10-24 09:48:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778999181] [2024-10-24 09:48:25,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:48:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:48:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:48:25,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:48:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:48:25,282 INFO L87 Difference]: Start difference. First operand 169 states and 229 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-24 09:48:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:26,236 INFO L93 Difference]: Finished difference Result 257 states and 340 transitions. [2024-10-24 09:48:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 09:48:26,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 127 [2024-10-24 09:48:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:26,242 INFO L225 Difference]: With dead ends: 257 [2024-10-24 09:48:26,242 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 09:48:26,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:48:26,243 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:26,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 158 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 09:48:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 09:48:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2024-10-24 09:48:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:48:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2024-10-24 09:48:26,266 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 127 [2024-10-24 09:48:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:26,267 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2024-10-24 09:48:26,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-24 09:48:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2024-10-24 09:48:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:26,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:26,268 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:26,278 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 (6)] Ended with exit code 0 [2024-10-24 09:48:26,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-24 09:48:26,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:26,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1416582265, now seen corresponding path program 1 times [2024-10-24 09:48:26,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:26,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501465160] [2024-10-24 09:48:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:26,472 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-10-24 09:48:26,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:26,473 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-24 09:48:26,474 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 (7)] Waiting until timeout for monitored process [2024-10-24 09:48:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:26,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 09:48:26,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:48:26,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:48:26,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:48:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501465160] [2024-10-24 09:48:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501465160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:48:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:48:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:48:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471910875] [2024-10-24 09:48:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:48:26,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:48:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:48:26,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:48:26,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:48:26,836 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:27,394 INFO L93 Difference]: Finished difference Result 230 states and 309 transitions. [2024-10-24 09:48:27,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:48:27,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 09:48:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:27,396 INFO L225 Difference]: With dead ends: 230 [2024-10-24 09:48:27,396 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 09:48:27,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:48:27,397 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 87 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:27,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 186 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 09:48:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 09:48:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-24 09:48:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:48:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 224 transitions. [2024-10-24 09:48:27,417 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 224 transitions. Word has length 127 [2024-10-24 09:48:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:27,418 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 224 transitions. [2024-10-24 09:48:27,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:48:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2024-10-24 09:48:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 09:48:27,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:27,419 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:27,427 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 (7)] Ended with exit code 0 [2024-10-24 09:48:27,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-24 09:48:27,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:27,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash 607235639, now seen corresponding path program 1 times [2024-10-24 09:48:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719082937] [2024-10-24 09:48:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:27,622 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-10-24 09:48:27,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:27,624 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-24 09:48:27,625 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 (8)] Waiting until timeout for monitored process [2024-10-24 09:48:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:27,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:48:27,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-24 09:48:28,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:28,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:48:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719082937] [2024-10-24 09:48:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719082937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:48:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1064367109] [2024-10-24 09:48:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:28,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:48:28,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:48:28,608 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:48:28,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-24 09:48:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:29,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 09:48:29,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:48:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-24 09:48:29,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:48:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1064367109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:48:30,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:48:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-24 09:48:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934682714] [2024-10-24 09:48:30,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:48:30,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:48:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:48:30,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:48:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-24 09:48:30,050 INFO L87 Difference]: Start difference. First operand 167 states and 224 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-24 09:48:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:48:32,904 INFO L93 Difference]: Finished difference Result 256 states and 330 transitions. [2024-10-24 09:48:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 09:48:32,906 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 127 [2024-10-24 09:48:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:48:32,907 INFO L225 Difference]: With dead ends: 256 [2024-10-24 09:48:32,907 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 09:48:32,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 09:48:32,908 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 180 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 09:48:32,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 302 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 09:48:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 09:48:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-10-24 09:48:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:48:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2024-10-24 09:48:32,934 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 127 [2024-10-24 09:48:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:48:32,934 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2024-10-24 09:48:32,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-24 09:48:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2024-10-24 09:48:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 09:48:32,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:48:32,938 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:48:32,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-24 09:48:33,146 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 (8)] Ended with exit code 0 [2024-10-24 09:48:33,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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-10-24 09:48:33,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:48:33,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:48:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2061861400, now seen corresponding path program 1 times [2024-10-24 09:48:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:48:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95120091] [2024-10-24 09:48:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:48:33,341 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-10-24 09:48:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:48:33,343 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-24 09:48:33,344 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 (10)] Waiting until timeout for monitored process [2024-10-24 09:48:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:48:33,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 09:48:33,489 INFO L278 TraceCheckSpWp]: Computing forward predicates...