./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.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 72b7effb17cf3f77db7662b0aba38c24782f5cf6d667a4af329d24c8b04c8a1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:39:06,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:39:06,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:39:06,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:39:06,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:39:06,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:39:06,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:39:06,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:39:06,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:39:06,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:39:06,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:39:06,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:39:06,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:39:06,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:39:06,447 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:39:06,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:39:06,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:39:06,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:39:06,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:39:06,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:39:06,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:39:06,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:39:06,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:39:06,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:39:06,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:39:06,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:39:06,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:39:06,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:39:06,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:39:06,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:39:06,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:39:06,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:39:06,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:39:06,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:39:06,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:39:06,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:39:06,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:39:06,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:39:06,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:39:06,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:39:06,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:39:06,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:39:06,463 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 -> 72b7effb17cf3f77db7662b0aba38c24782f5cf6d667a4af329d24c8b04c8a1f [2024-11-16 16:39:06,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:39:06,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:39:06,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:39:06,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:39:06,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:39:06,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i [2024-11-16 16:39:08,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:39:08,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:39:08,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i [2024-11-16 16:39:08,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3a5cfac/c44a90980be94709b6c79b737d70290d/FLAGee444199b [2024-11-16 16:39:08,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3a5cfac/c44a90980be94709b6c79b737d70290d [2024-11-16 16:39:08,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:39:08,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:39:08,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:39:08,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:39:08,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:39:08,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522c1139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08, skipping insertion in model container [2024-11-16 16:39:08,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:39:08,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i[914,927] [2024-11-16 16:39:08,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:39:08,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:39:08,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i[914,927] [2024-11-16 16:39:08,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:39:08,798 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:39:08,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08 WrapperNode [2024-11-16 16:39:08,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:39:08,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:39:08,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:39:08,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:39:08,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,845 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-16 16:39:08,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:39:08,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:39:08,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:39:08,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:39:08,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,892 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:39:08,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:39:08,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:39:08,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:39:08,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:39:08,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (1/1) ... [2024-11-16 16:39:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:39:08,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:39:08,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:39:08,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:39:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:39:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:39:09,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:39:09,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:39:09,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:39:09,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:39:09,118 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:39:09,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:39:09,468 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 16:39:09,468 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:39:09,491 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:39:09,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:39:09,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:39:09 BoogieIcfgContainer [2024-11-16 16:39:09,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:39:09,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:39:09,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:39:09,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:39:09,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:39:08" (1/3) ... [2024-11-16 16:39:09,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cfba09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:39:09, skipping insertion in model container [2024-11-16 16:39:09,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:08" (2/3) ... [2024-11-16 16:39:09,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cfba09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:39:09, skipping insertion in model container [2024-11-16 16:39:09,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:39:09" (3/3) ... [2024-11-16 16:39:09,505 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-1.i [2024-11-16 16:39:09,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:39:09,522 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:39:09,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:39:09,599 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;@508b2aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:39:09,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:39:09,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 16:39:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 16:39:09,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:09,620 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:09,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1459546091, now seen corresponding path program 1 times [2024-11-16 16:39:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964747549] [2024-11-16 16:39:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 16:39:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 16:39:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:39:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:39:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:39:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:39:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:39:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:39:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:39:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:39:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:39:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:39:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:39:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:39:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:39:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:39:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:39:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:39:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:39:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:39:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:39:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:39:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964747549] [2024-11-16 16:39:10,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964747549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:10,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:10,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:39:10,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953160656] [2024-11-16 16:39:10,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:10,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:39:10,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:39:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:39:10,158 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:10,193 INFO L93 Difference]: Finished difference Result 138 states and 231 transitions. [2024-11-16 16:39:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:39:10,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-11-16 16:39:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:10,203 INFO L225 Difference]: With dead ends: 138 [2024-11-16 16:39:10,203 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 16:39:10,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:39:10,209 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:10,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:39:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 16:39:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-16 16:39:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 16:39:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-16 16:39:10,256 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 148 [2024-11-16 16:39:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:10,256 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-16 16:39:10,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-16 16:39:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 16:39:10,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:10,261 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:10,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:39:10,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:10,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -773428374, now seen corresponding path program 1 times [2024-11-16 16:39:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073225898] [2024-11-16 16:39:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 16:39:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 16:39:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:39:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:39:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:39:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:39:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:39:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:39:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:39:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:39:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:39:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:39:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:39:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:39:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:39:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:39:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:39:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:39:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:39:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:39:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:39:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:39:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073225898] [2024-11-16 16:39:11,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073225898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:11,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:11,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:39:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909427955] [2024-11-16 16:39:11,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:11,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:39:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:39:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:39:11,052 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:11,108 INFO L93 Difference]: Finished difference Result 192 states and 285 transitions. [2024-11-16 16:39:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:39:11,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-11-16 16:39:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:11,112 INFO L225 Difference]: With dead ends: 192 [2024-11-16 16:39:11,115 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 16:39:11,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:39:11,117 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 44 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:11,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:39:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 16:39:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2024-11-16 16:39:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 16:39:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2024-11-16 16:39:11,154 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 148 [2024-11-16 16:39:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:11,155 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2024-11-16 16:39:11,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2024-11-16 16:39:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:11,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:11,160 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:11,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:39:11,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:11,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash 334405886, now seen corresponding path program 1 times [2024-11-16 16:39:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678901150] [2024-11-16 16:39:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 16:39:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 16:39:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:39:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:39:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:39:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:39:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:39:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:39:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:39:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:39:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:39:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:39:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:39:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:39:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:39:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:39:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:39:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:39:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:39:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:39:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:39:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:39:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678901150] [2024-11-16 16:39:11,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678901150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:11,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:11,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 16:39:11,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273831325] [2024-11-16 16:39:11,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:11,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:39:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:39:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:39:11,731 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:12,593 INFO L93 Difference]: Finished difference Result 411 states and 593 transitions. [2024-11-16 16:39:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:39:12,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 149 [2024-11-16 16:39:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:12,599 INFO L225 Difference]: With dead ends: 411 [2024-11-16 16:39:12,601 INFO L226 Difference]: Without dead ends: 348 [2024-11-16 16:39:12,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:39:12,605 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 340 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:12,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 306 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 16:39:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-16 16:39:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 156. [2024-11-16 16:39:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.276190476190476) internal successors, (134), 105 states have internal predecessors, (134), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 16:39:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2024-11-16 16:39:12,675 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 149 [2024-11-16 16:39:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:12,675 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2024-11-16 16:39:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2024-11-16 16:39:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:12,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:12,681 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:12,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:39:12,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:12,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash 248863005, now seen corresponding path program 1 times [2024-11-16 16:39:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:12,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524268983] [2024-11-16 16:39:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 16:39:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 16:39:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:39:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:39:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:39:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:39:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:39:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:39:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:39:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:39:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:39:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:39:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:39:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:39:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:39:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:39:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:39:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:39:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:39:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:39:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:39:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:39:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524268983] [2024-11-16 16:39:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524268983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:13,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:13,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:39:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258037438] [2024-11-16 16:39:13,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:13,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:39:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:39:13,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:39:13,272 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:13,692 INFO L93 Difference]: Finished difference Result 437 states and 633 transitions. [2024-11-16 16:39:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:39:13,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 149 [2024-11-16 16:39:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:13,698 INFO L225 Difference]: With dead ends: 437 [2024-11-16 16:39:13,698 INFO L226 Difference]: Without dead ends: 284 [2024-11-16 16:39:13,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:39:13,703 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 141 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:13,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 377 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:39:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-16 16:39:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 178. [2024-11-16 16:39:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 127 states have internal predecessors, (163), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 16:39:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 255 transitions. [2024-11-16 16:39:13,760 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 255 transitions. Word has length 149 [2024-11-16 16:39:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 255 transitions. [2024-11-16 16:39:13,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 255 transitions. [2024-11-16 16:39:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:13,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:13,764 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:13,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:39:13,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:13,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash 220233854, now seen corresponding path program 1 times [2024-11-16 16:39:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:13,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995477392] [2024-11-16 16:39:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 16:39:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 16:39:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:39:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:39:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:39:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:39:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:39:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:39:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:39:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:39:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:39:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:39:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:39:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:39:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:39:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:39:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:39:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:39:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:39:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:39:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:39:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:39:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995477392] [2024-11-16 16:39:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995477392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:13,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:39:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716679957] [2024-11-16 16:39:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:13,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:39:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:39:13,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:39:13,986 INFO L87 Difference]: Start difference. First operand 178 states and 255 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:14,176 INFO L93 Difference]: Finished difference Result 450 states and 645 transitions. [2024-11-16 16:39:14,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:39:14,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 149 [2024-11-16 16:39:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:14,180 INFO L225 Difference]: With dead ends: 450 [2024-11-16 16:39:14,180 INFO L226 Difference]: Without dead ends: 275 [2024-11-16 16:39:14,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:39:14,181 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 84 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:14,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 335 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:39:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-16 16:39:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 170. [2024-11-16 16:39:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.26890756302521) internal successors, (151), 119 states have internal predecessors, (151), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 16:39:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 243 transitions. [2024-11-16 16:39:14,218 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 243 transitions. Word has length 149 [2024-11-16 16:39:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:14,219 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 243 transitions. [2024-11-16 16:39:14,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 243 transitions. [2024-11-16 16:39:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:14,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:14,221 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:14,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:39:14,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:14,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash 463488605, now seen corresponding path program 1 times [2024-11-16 16:39:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:14,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547489221] [2024-11-16 16:39:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:39:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 16:39:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 16:39:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 16:39:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 16:39:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 16:39:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 16:39:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 16:39:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:39:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:39:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:39:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:39:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:39:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:39:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:39:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:39:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:39:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:39:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:39:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:39:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:39:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:39:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:39:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:14,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:39:14,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547489221] [2024-11-16 16:39:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547489221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:14,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:39:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369243380] [2024-11-16 16:39:14,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:14,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:39:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:39:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:39:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:39:14,555 INFO L87 Difference]: Start difference. First operand 170 states and 243 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:14,911 INFO L93 Difference]: Finished difference Result 344 states and 488 transitions. [2024-11-16 16:39:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:39:14,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 149 [2024-11-16 16:39:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:14,914 INFO L225 Difference]: With dead ends: 344 [2024-11-16 16:39:14,914 INFO L226 Difference]: Without dead ends: 259 [2024-11-16 16:39:14,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:39:14,917 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 177 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:14,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 212 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:39:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-16 16:39:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2024-11-16 16:39:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.2521008403361344) internal successors, (149), 119 states have internal predecessors, (149), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 16:39:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2024-11-16 16:39:14,966 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 149 [2024-11-16 16:39:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:14,967 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2024-11-16 16:39:14,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2024-11-16 16:39:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:14,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:14,968 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:14,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:39:14,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:14,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash 349316573, now seen corresponding path program 1 times [2024-11-16 16:39:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:39:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566617951] [2024-11-16 16:39:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:39:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:39:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103517449] [2024-11-16 16:39:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:15,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:39:15,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:39:15,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:39:15,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 16:39:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:39:15,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:39:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:39:15,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:39:15,392 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:39:15,393 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:39:15,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 16:39:15,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:39:15,603 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:15,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:39:15,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:39:15 BoogieIcfgContainer [2024-11-16 16:39:15,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:39:15,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:39:15,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:39:15,726 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:39:15,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:39:09" (3/4) ... [2024-11-16 16:39:15,729 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:39:15,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:39:15,731 INFO L158 Benchmark]: Toolchain (without parser) took 7283.57ms. Allocated memory was 161.5MB in the beginning and 237.0MB in the end (delta: 75.5MB). Free memory was 128.9MB in the beginning and 87.0MB in the end (delta: 41.9MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2024-11-16 16:39:15,731 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:39:15,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.63ms. Allocated memory is still 161.5MB. Free memory was 128.9MB in the beginning and 112.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 16:39:15,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.52ms. Allocated memory is still 161.5MB. Free memory was 112.2MB in the beginning and 109.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:39:15,732 INFO L158 Benchmark]: Boogie Preprocessor took 70.56ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 104.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:39:15,732 INFO L158 Benchmark]: IcfgBuilder took 576.76ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 115.5MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 16:39:15,732 INFO L158 Benchmark]: TraceAbstraction took 6228.31ms. Allocated memory was 161.5MB in the beginning and 237.0MB in the end (delta: 75.5MB). Free memory was 114.5MB in the beginning and 87.0MB in the end (delta: 27.5MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2024-11-16 16:39:15,732 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 237.0MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:39:15,734 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 161.5MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.63ms. Allocated memory is still 161.5MB. Free memory was 128.9MB in the beginning and 112.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.52ms. Allocated memory is still 161.5MB. Free memory was 112.2MB in the beginning and 109.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.56ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 104.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 576.76ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 115.5MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6228.31ms. Allocated memory was 161.5MB in the beginning and 237.0MB in the end (delta: 75.5MB). Free memory was 114.5MB in the beginning and 87.0MB in the end (delta: 27.5MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 237.0MB. Free memory is still 87.0MB. 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 134, overapproximation of someBinaryFLOATComparisonOperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2, var_1_9=4000000001/4] [L138] isInitial = 1 [L139] FCALL initially() [L140] int k_loop; [L141] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2, var_1_9=4000000001/4] [L141] COND TRUE k_loop < 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L94] var_1_9 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L95] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L96] var_1_11 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L97] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L98] var_1_13 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L99] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L100] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L100] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L101] var_1_14 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L102] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L103] var_1_16 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L104] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L106] var_1_17 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L107] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L110] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L116] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L119] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L121] var_1_24 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L122] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L123] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L123] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L124] var_1_25 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L125] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L126] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L126] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L127] var_1_26 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L128] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L129] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L129] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L143] RET updateVariables() [L144] CALL step() [L46] var_1_15 = (var_1_16 - var_1_17) [L47] var_1_27 = var_1_21 [L48] unsigned char stepLocal_1 = var_1_27; [L49] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L50] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L51] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L59] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L62] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L63] COND FALSE !(var_1_27 > stepLocal_2) [L66] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L68] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L69] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L71] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L72] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L81] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L82] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L83] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L86] COND TRUE 1 >= stepLocal_3 [L87] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L144] RET step() [L145] CALL, EXPR property() [L134-L135] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 786 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 786 mSDsluCounter, 1522 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 818 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 814 IncrementalHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 704 mSDtfsCounter, 814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 495 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1190 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 886 ConstructedInterpolants, 0 QuantifiedInterpolants, 1896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 6072/6072 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-11-16 16:39:15,758 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.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 72b7effb17cf3f77db7662b0aba38c24782f5cf6d667a4af329d24c8b04c8a1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:39:18,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:39:18,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:39:18,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:39:18,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:39:18,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:39:18,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:39:18,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:39:18,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:39:18,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:39:18,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:39:18,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:39:18,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:39:18,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:39:18,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:39:18,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:39:18,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:39:18,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:39:18,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:39:18,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:39:18,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:39:18,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:39:18,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:39:18,184 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:39:18,184 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:39:18,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:39:18,185 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:39:18,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:39:18,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:39:18,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:39:18,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:39:18,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:39:18,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:39:18,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:39:18,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:39:18,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:39:18,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:39:18,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:39:18,188 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:39:18,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:39:18,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:39:18,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:39:18,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:39:18,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:39:18,190 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 -> 72b7effb17cf3f77db7662b0aba38c24782f5cf6d667a4af329d24c8b04c8a1f [2024-11-16 16:39:18,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:39:18,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:39:18,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:39:18,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:39:18,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:39:18,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i [2024-11-16 16:39:20,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:39:20,400 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:39:20,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i [2024-11-16 16:39:20,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8260c1377/968b656131714d46a6a5a6f099935c53/FLAGbcdef1738 [2024-11-16 16:39:20,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8260c1377/968b656131714d46a6a5a6f099935c53 [2024-11-16 16:39:20,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:39:20,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:39:20,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:39:20,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:39:20,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:39:20,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7065f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20, skipping insertion in model container [2024-11-16 16:39:20,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:39:20,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i[914,927] [2024-11-16 16:39:20,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:39:20,786 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:39:20,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-1.i[914,927] [2024-11-16 16:39:20,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:39:20,866 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:39:20,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20 WrapperNode [2024-11-16 16:39:20,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:39:20,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:39:20,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:39:20,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:39:20,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,928 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-16 16:39:20,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:39:20,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:39:20,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:39:20,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:39:20,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,975 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:39:20,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:20,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:21,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:39:21,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:39:21,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:39:21,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:39:21,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (1/1) ... [2024-11-16 16:39:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:39:21,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:39:21,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 16:39:21,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 16:39:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:39:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:39:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:39:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:39:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:39:21,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:39:21,193 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:39:21,196 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:39:21,587 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 16:39:21,587 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:39:21,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:39:21,601 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:39:21,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:39:21 BoogieIcfgContainer [2024-11-16 16:39:21,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:39:21,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:39:21,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:39:21,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:39:21,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:39:20" (1/3) ... [2024-11-16 16:39:21,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ba61b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:39:21, skipping insertion in model container [2024-11-16 16:39:21,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:39:20" (2/3) ... [2024-11-16 16:39:21,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ba61b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:39:21, skipping insertion in model container [2024-11-16 16:39:21,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:39:21" (3/3) ... [2024-11-16 16:39:21,611 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-1.i [2024-11-16 16:39:21,627 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:39:21,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:39:21,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:39:21,714 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;@18d8d39b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:39:21,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:39:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 16:39:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 16:39:21,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:21,736 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:21,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:21,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1459546091, now seen corresponding path program 1 times [2024-11-16 16:39:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:39:21,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617839695] [2024-11-16 16:39:21,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:21,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:21,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:39:21,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:39:21,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 16:39:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:22,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:39:22,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-16 16:39:22,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:39:22,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:39:22,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617839695] [2024-11-16 16:39:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617839695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:22,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:39:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409755391] [2024-11-16 16:39:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:39:22,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:39:22,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:39:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:39:22,161 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:22,204 INFO L93 Difference]: Finished difference Result 138 states and 231 transitions. [2024-11-16 16:39:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:39:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-11-16 16:39:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:22,218 INFO L225 Difference]: With dead ends: 138 [2024-11-16 16:39:22,218 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 16:39:22,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:39:22,230 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:22,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:39:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 16:39:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-16 16:39:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 16:39:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-16 16:39:22,291 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 148 [2024-11-16 16:39:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:22,291 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-16 16:39:22,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 16:39:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-16 16:39:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 16:39:22,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:22,296 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:22,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:39:22,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:22,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:22,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash -773428374, now seen corresponding path program 1 times [2024-11-16 16:39:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:39:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870339366] [2024-11-16 16:39:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:22,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:39:22,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:39:22,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 16:39:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:22,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 16:39:22,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 527 proven. 48 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-16 16:39:23,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:39:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:23,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:39:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870339366] [2024-11-16 16:39:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870339366] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 16:39:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:39:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-16 16:39:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493423416] [2024-11-16 16:39:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:39:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:39:23,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:39:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:39:23,479 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:23,541 INFO L93 Difference]: Finished difference Result 129 states and 191 transitions. [2024-11-16 16:39:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:39:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-11-16 16:39:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:23,546 INFO L225 Difference]: With dead ends: 129 [2024-11-16 16:39:23,546 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 16:39:23,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:39:23,549 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:23,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:39:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 16:39:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-16 16:39:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 16:39:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2024-11-16 16:39:23,567 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 148 [2024-11-16 16:39:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:23,569 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2024-11-16 16:39:23,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2024-11-16 16:39:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 16:39:23,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:23,575 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:23,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 16:39:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:23,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1724587563, now seen corresponding path program 1 times [2024-11-16 16:39:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:39:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083553525] [2024-11-16 16:39:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:23,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:23,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:39:23,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:39:23,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 16:39:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:23,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 16:39:23,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:24,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:39:24,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:39:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083553525] [2024-11-16 16:39:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083553525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:24,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:39:24,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:39:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708673050] [2024-11-16 16:39:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:24,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:39:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:39:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:39:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:39:24,238 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:24,307 INFO L93 Difference]: Finished difference Result 192 states and 282 transitions. [2024-11-16 16:39:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:39:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-11-16 16:39:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:24,312 INFO L225 Difference]: With dead ends: 192 [2024-11-16 16:39:24,312 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 16:39:24,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:39:24,314 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:24,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:39:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 16:39:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2024-11-16 16:39:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 77 states have internal predecessors, (94), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 16:39:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 186 transitions. [2024-11-16 16:39:24,333 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 186 transitions. Word has length 148 [2024-11-16 16:39:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:24,334 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 186 transitions. [2024-11-16 16:39:24,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 186 transitions. [2024-11-16 16:39:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:24,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:24,337 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:24,345 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-11-16 16:39:24,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:24,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 463488605, now seen corresponding path program 1 times [2024-11-16 16:39:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:39:24,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726470812] [2024-11-16 16:39:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:39:24,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:39:24,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 16:39:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:24,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 16:39:24,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 516 proven. 27 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2024-11-16 16:39:24,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:39:25,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:39:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726470812] [2024-11-16 16:39:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726470812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:39:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [704801039] [2024-11-16 16:39:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:25,076 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 16:39:25,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 16:39:25,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 16:39:25,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-16 16:39:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:25,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 16:39:25,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:25,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:39:25,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [704801039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:39:25,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:39:25,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-16 16:39:25,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475070509] [2024-11-16 16:39:25,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:25,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:39:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:39:25,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:39:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:39:25,712 INFO L87 Difference]: Start difference. First operand 126 states and 186 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:26,225 INFO L93 Difference]: Finished difference Result 318 states and 458 transitions. [2024-11-16 16:39:26,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:39:26,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 149 [2024-11-16 16:39:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:26,229 INFO L225 Difference]: With dead ends: 318 [2024-11-16 16:39:26,229 INFO L226 Difference]: Without dead ends: 255 [2024-11-16 16:39:26,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:39:26,231 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 168 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:26,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 310 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:39:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-16 16:39:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 171. [2024-11-16 16:39:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 108 states have internal predecessors, (128), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-16 16:39:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2024-11-16 16:39:26,289 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 149 [2024-11-16 16:39:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:26,291 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2024-11-16 16:39:26,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2024-11-16 16:39:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:26,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:26,297 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:26,309 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 (5)] Ended with exit code 0 [2024-11-16 16:39:26,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-16 16:39:26,698 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 16:39:26,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:26,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 377945724, now seen corresponding path program 1 times [2024-11-16 16:39:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:39:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904369095] [2024-11-16 16:39:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:39:26,703 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-11-16 16:39:26,704 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-11-16 16:39:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:26,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 16:39:26,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:39:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 527 proven. 48 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-16 16:39:27,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:39:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 16:39:27,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:39:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904369095] [2024-11-16 16:39:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904369095] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 16:39:27,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:39:27,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-16 16:39:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400052090] [2024-11-16 16:39:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:39:27,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:39:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:39:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:39:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:39:27,429 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:39:27,770 INFO L93 Difference]: Finished difference Result 563 states and 802 transitions. [2024-11-16 16:39:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:39:27,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 149 [2024-11-16 16:39:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:39:27,781 INFO L225 Difference]: With dead ends: 563 [2024-11-16 16:39:27,783 INFO L226 Difference]: Without dead ends: 418 [2024-11-16 16:39:27,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:39:27,788 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 206 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:39:27,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 409 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:39:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-16 16:39:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 250. [2024-11-16 16:39:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 161 states have (on average 1.1987577639751552) internal successors, (193), 163 states have internal predecessors, (193), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-16 16:39:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 357 transitions. [2024-11-16 16:39:27,851 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 357 transitions. Word has length 149 [2024-11-16 16:39:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:39:27,851 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 357 transitions. [2024-11-16 16:39:27,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 16:39:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 357 transitions. [2024-11-16 16:39:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 16:39:27,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:39:27,854 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:39:27,862 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 (7)] Forceful destruction successful, exit code 0 [2024-11-16 16:39:28,054 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-11-16 16:39:28,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:39:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:39:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 349316573, now seen corresponding path program 1 times [2024-11-16 16:39:28,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:39:28,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790696043] [2024-11-16 16:39:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:39:28,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:39:28,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:39:28,059 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-11-16 16:39:28,060 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-11-16 16:39:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:39:28,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 16:39:28,224 INFO L278 TraceCheckSpWp]: Computing forward predicates...