./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.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_codestructure_dependencies_file-11.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 9d1f41225cd95f570d39f7dc152bf434eeb5ae603d7cefe611440d61ef080184 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:00:22,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:00:22,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:00:22,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:00:22,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:00:22,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:00:22,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:00:22,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:00:22,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:00:22,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:00:22,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:00:22,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:00:22,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:00:22,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:00:22,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:00:22,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:00:22,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:00:22,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:00:22,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:00:22,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:00:22,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:00:22,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:00:22,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:00:22,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:00:22,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:00:22,213 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:00:22,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:00:22,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:00:22,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:00:22,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:00:22,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:00:22,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:00:22,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:22,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:00:22,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:00:22,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:00:22,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:00:22,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:00:22,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:00:22,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:00:22,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:00:22,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:00:22,220 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 -> 9d1f41225cd95f570d39f7dc152bf434eeb5ae603d7cefe611440d61ef080184 [2024-11-16 12:00:22,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:00:22,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:00:22,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:00:22,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:00:22,549 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:00:22,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i [2024-11-16 12:00:24,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:00:24,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:00:24,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i [2024-11-16 12:00:24,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654e2130d/7708d81fbc5a4c7bad0efda09c1b936c/FLAGc3690cf25 [2024-11-16 12:00:24,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654e2130d/7708d81fbc5a4c7bad0efda09c1b936c [2024-11-16 12:00:24,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:00:24,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:00:24,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:24,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:00:24,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:00:24,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224ca0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24, skipping insertion in model container [2024-11-16 12:00:24,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:00:24,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i[919,932] [2024-11-16 12:00:24,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:24,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:00:24,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i[919,932] [2024-11-16 12:00:24,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:24,842 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:00:24,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24 WrapperNode [2024-11-16 12:00:24,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:24,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:24,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:00:24,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:00:24,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,900 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-16 12:00:24,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:24,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:00:24,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:00:24,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:00:24,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,951 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 12:00:24,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:00:24,974 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:00:24,974 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:00:24,974 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:00:24,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (1/1) ... [2024-11-16 12:00:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:24,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:25,025 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 12:00:25,028 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 12:00:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:00:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:00:25,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:00:25,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:00:25,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:00:25,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:00:25,145 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:00:25,147 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:00:25,474 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:00:25,474 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:00:25,491 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:00:25,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:00:25,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:25 BoogieIcfgContainer [2024-11-16 12:00:25,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:00:25,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:00:25,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:00:25,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:00:25,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:24" (1/3) ... [2024-11-16 12:00:25,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1700c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:25, skipping insertion in model container [2024-11-16 12:00:25,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:24" (2/3) ... [2024-11-16 12:00:25,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1700c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:25, skipping insertion in model container [2024-11-16 12:00:25,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:25" (3/3) ... [2024-11-16 12:00:25,503 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-11.i [2024-11-16 12:00:25,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:00:25,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:00:25,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:00:25,590 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;@2f39817d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:00:25,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:00:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 12:00:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:00:25,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:25,606 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:25,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:25,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash 262802741, now seen corresponding path program 1 times [2024-11-16 12:00:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:25,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299858671] [2024-11-16 12:00:25,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:25,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 12:00:26,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299858671] [2024-11-16 12:00:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299858671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:26,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:00:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969037618] [2024-11-16 12:00:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:26,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:00:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:26,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:00:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:00:26,093 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 12:00:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:26,116 INFO L93 Difference]: Finished difference Result 110 states and 186 transitions. [2024-11-16 12:00:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:00:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-11-16 12:00:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:26,125 INFO L225 Difference]: With dead ends: 110 [2024-11-16 12:00:26,125 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 12:00:26,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 12:00:26,132 INFO L432 NwaCegarLoop]: 79 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, 79 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 12:00:26,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:00:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 12:00:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 12:00:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 12:00:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-16 12:00:26,170 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 111 [2024-11-16 12:00:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:26,171 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-16 12:00:26,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 12:00:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-16 12:00:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:00:26,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:26,175 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:26,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:00:26,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:26,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2132862838, now seen corresponding path program 1 times [2024-11-16 12:00:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45937468] [2024-11-16 12:00:26,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:26,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 12:00:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45937468] [2024-11-16 12:00:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45937468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:00:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729135037] [2024-11-16 12:00:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:00:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:00:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:00:26,499 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:26,586 INFO L93 Difference]: Finished difference Result 151 states and 221 transitions. [2024-11-16 12:00:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:00:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-16 12:00:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:26,589 INFO L225 Difference]: With dead ends: 151 [2024-11-16 12:00:26,589 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 12:00:26,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 12:00:26,593 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:26,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 12:00:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 55. [2024-11-16 12:00:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 12:00:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2024-11-16 12:00:26,615 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 111 [2024-11-16 12:00:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:26,618 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-11-16 12:00:26,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2024-11-16 12:00:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:00:26,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:26,622 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:26,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:00:26,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:26,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2133475307, now seen corresponding path program 1 times [2024-11-16 12:00:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787737590] [2024-11-16 12:00:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 12:00:27,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787737590] [2024-11-16 12:00:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787737590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:00:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314331110] [2024-11-16 12:00:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:27,354 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:27,595 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2024-11-16 12:00:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:27,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-16 12:00:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:27,598 INFO L225 Difference]: With dead ends: 161 [2024-11-16 12:00:27,600 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 12:00:27,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:27,602 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 53 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:27,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 212 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 12:00:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2024-11-16 12:00:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:00:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2024-11-16 12:00:27,642 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 111 [2024-11-16 12:00:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:27,645 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2024-11-16 12:00:27,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2024-11-16 12:00:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 12:00:27,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:27,649 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:27,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:00:27,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:27,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1422990918, now seen corresponding path program 1 times [2024-11-16 12:00:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642818090] [2024-11-16 12:00:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:00:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:00:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:00:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:00:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:00:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:00:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:00:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:00:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:00:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:00:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:00:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:00:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:00:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:00:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:00:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:00:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:00:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-16 12:00:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:00:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642818090] [2024-11-16 12:00:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642818090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:00:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44388155] [2024-11-16 12:00:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:28,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:28,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:28,393 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 12:00:28,394 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 12:00:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:28,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 12:00:28,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-16 12:00:28,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:00:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-16 12:00:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44388155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:00:29,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:00:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-16 12:00:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599497916] [2024-11-16 12:00:29,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:00:29,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 12:00:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:00:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 12:00:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:00:29,049 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-16 12:00:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:29,288 INFO L93 Difference]: Finished difference Result 156 states and 220 transitions. [2024-11-16 12:00:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 12:00:29,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 112 [2024-11-16 12:00:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:29,293 INFO L225 Difference]: With dead ends: 156 [2024-11-16 12:00:29,293 INFO L226 Difference]: Without dead ends: 104 [2024-11-16 12:00:29,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-16 12:00:29,295 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 132 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:29,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:00:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-16 12:00:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2024-11-16 12:00:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:00:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-16 12:00:29,319 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 112 [2024-11-16 12:00:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:29,320 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-16 12:00:29,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-16 12:00:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-16 12:00:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 12:00:29,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:29,322 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:29,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 12:00:29,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:00:29,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:29,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1022154642, now seen corresponding path program 1 times [2024-11-16 12:00:29,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:00:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705166248] [2024-11-16 12:00:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:00:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:00:29,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:00:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:00:29,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:00:29,843 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:00:29,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:00:29,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:00:29,849 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 12:00:29,943 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:00:29,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:00:29 BoogieIcfgContainer [2024-11-16 12:00:29,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:00:29,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:00:29,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:00:29,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:00:29,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:25" (3/4) ... [2024-11-16 12:00:29,951 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:00:29,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:00:29,954 INFO L158 Benchmark]: Toolchain (without parser) took 5490.40ms. Allocated memory was 138.4MB in the beginning and 226.5MB in the end (delta: 88.1MB). Free memory was 80.3MB in the beginning and 72.0MB in the end (delta: 8.2MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2024-11-16 12:00:29,954 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:00:29,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.74ms. Allocated memory is still 138.4MB. Free memory was 80.1MB in the beginning and 65.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:00:29,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.31ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 65.2MB in the beginning and 159.0MB in the end (delta: -93.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-16 12:00:29,958 INFO L158 Benchmark]: Boogie Preprocessor took 55.83ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 159.7MB in the end (delta: -656.2kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-11-16 12:00:29,958 INFO L158 Benchmark]: IcfgBuilder took 518.29ms. Allocated memory is still 188.7MB. Free memory was 159.7MB in the beginning and 141.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 12:00:29,958 INFO L158 Benchmark]: TraceAbstraction took 4453.04ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 140.7MB in the beginning and 72.0MB in the end (delta: 68.7MB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. [2024-11-16 12:00:29,958 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 226.5MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:00:29,960 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.74ms. Allocated memory is still 138.4MB. Free memory was 80.1MB in the beginning and 65.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.31ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 65.2MB in the beginning and 159.0MB in the end (delta: -93.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.83ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 159.7MB in the end (delta: -656.2kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * IcfgBuilder took 518.29ms. Allocated memory is still 188.7MB. Free memory was 159.7MB in the beginning and 141.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4453.04ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 140.7MB in the beginning and 72.0MB in the end (delta: 68.7MB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 226.5MB. Free memory is still 72.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 118, overapproximation of someUnaryDOUBLEoperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] unsigned long int last_1_var_1_10 = 128; [L40] unsigned long int last_1_var_1_16 = 1; [L41] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_16 = var_1_16 [L115] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L86] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L87] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L87] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L91] var_1_7 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L94] var_1_8 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L95] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L96] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L97] var_1_9 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L98] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L99] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L100] var_1_11 = __VERIFIER_nondet_ulong() [L101] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L101] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L103] var_1_17 = __VERIFIER_nondet_ulong() [L104] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L104] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L106] var_1_18 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L107] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L109] var_1_20 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L110] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L126] RET updateVariables() [L127] CALL step() [L45] COND TRUE last_1_var_1_16 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L46] COND FALSE !(var_1_8 <= last_1_var_1_16) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L54] COND TRUE var_1_12 == var_1_12 [L55] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L57] var_1_1 = (var_1_2 || (! var_1_3)) [L58] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L59] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L60] COND TRUE var_1_19 != var_1_19 [L61] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=2, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L69] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=-50, var_1_16=2, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L70] COND FALSE !(var_1_19 >= var_1_19) [L75] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L80] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && var_1_1 [L81] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L127] RET step() [L128] CALL, EXPR property() [L118-L119] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=10469477755, var_1_11=-6442450946, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=2147483647, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 620 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 339 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 73 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 2049 SizeOfPredicates, 3 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3147/3264 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 12:00:29,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_codestructure_dependencies_file-11.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 9d1f41225cd95f570d39f7dc152bf434eeb5ae603d7cefe611440d61ef080184 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:00:32,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:00:32,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:00:32,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:00:32,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:00:32,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:00:32,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:00:32,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:00:32,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:00:32,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:00:32,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:00:32,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:00:32,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:00:32,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:00:32,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:00:32,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:00:32,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:00:32,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:00:32,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:00:32,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:00:32,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:00:32,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:00:32,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:00:32,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:00:32,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:00:32,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:00:32,424 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:00:32,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:00:32,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:00:32,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:00:32,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:00:32,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:00:32,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:00:32,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:00:32,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:32,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:00:32,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:00:32,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:00:32,429 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:00:32,430 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:00:32,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:00:32,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:00:32,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:00:32,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:00:32,431 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 -> 9d1f41225cd95f570d39f7dc152bf434eeb5ae603d7cefe611440d61ef080184 [2024-11-16 12:00:32,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:00:32,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:00:32,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:00:32,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:00:32,827 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:00:32,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i [2024-11-16 12:00:34,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:00:34,645 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:00:34,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i [2024-11-16 12:00:34,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2ac1871/dea8ef67b7064261a8976bb24252549d/FLAG4ead6309f [2024-11-16 12:00:34,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa2ac1871/dea8ef67b7064261a8976bb24252549d [2024-11-16 12:00:34,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:00:34,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:00:34,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:34,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:00:35,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:00:35,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:34" (1/1) ... [2024-11-16 12:00:35,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24675713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35, skipping insertion in model container [2024-11-16 12:00:35,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:34" (1/1) ... [2024-11-16 12:00:35,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:00:35,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i[919,932] [2024-11-16 12:00:35,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:35,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:00:35,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-11.i[919,932] [2024-11-16 12:00:35,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:00:35,416 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:00:35,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35 WrapperNode [2024-11-16 12:00:35,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:00:35,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:35,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:00:35,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:00:35,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,475 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-16 12:00:35,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:00:35,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:00:35,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:00:35,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:00:35,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,512 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 12:00:35,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:00:35,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:00:35,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:00:35,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:00:35,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (1/1) ... [2024-11-16 12:00:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:00:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:00:35,568 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 12:00:35,574 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 12:00:35,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:00:35,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:00:35,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:00:35,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:00:35,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:00:35,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:00:35,688 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:00:35,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:00:36,011 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:00:36,011 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:00:36,023 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:00:36,023 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:00:36,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:36 BoogieIcfgContainer [2024-11-16 12:00:36,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:00:36,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:00:36,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:00:36,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:00:36,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:34" (1/3) ... [2024-11-16 12:00:36,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f22e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:36, skipping insertion in model container [2024-11-16 12:00:36,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:35" (2/3) ... [2024-11-16 12:00:36,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f22e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:36, skipping insertion in model container [2024-11-16 12:00:36,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:00:36" (3/3) ... [2024-11-16 12:00:36,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-11.i [2024-11-16 12:00:36,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:00:36,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:00:36,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:00:36,111 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;@31e8db73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:00:36,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:00:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 12:00:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:00:36,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:36,129 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:36,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:36,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash 262802741, now seen corresponding path program 1 times [2024-11-16 12:00:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:36,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266717649] [2024-11-16 12:00:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:36,150 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 12:00:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:36,154 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 12:00:36,154 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 12:00:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:36,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:00:36,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2024-11-16 12:00:36,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:36,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266717649] [2024-11-16 12:00:36,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266717649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:36,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:00:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694536784] [2024-11-16 12:00:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:36,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:00:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:36,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:00:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:00:36,449 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 12:00:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:36,481 INFO L93 Difference]: Finished difference Result 110 states and 186 transitions. [2024-11-16 12:00:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:00:36,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-11-16 12:00:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:36,490 INFO L225 Difference]: With dead ends: 110 [2024-11-16 12:00:36,490 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 12:00:36,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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 12:00:36,495 INFO L432 NwaCegarLoop]: 79 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, 79 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 12:00:36,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:00:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 12:00:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 12:00:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 12:00:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-16 12:00:36,530 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 111 [2024-11-16 12:00:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:36,530 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-16 12:00:36,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 12:00:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-16 12:00:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:00:36,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:36,533 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:36,538 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 12:00:36,733 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 12:00:36,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2132862838, now seen corresponding path program 1 times [2024-11-16 12:00:36,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:36,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718518429] [2024-11-16 12:00:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:36,736 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 12:00:36,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:36,739 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 12:00:36,740 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 12:00:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:36,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 12:00:36,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 12:00:37,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:37,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718518429] [2024-11-16 12:00:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718518429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:37,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:37,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:00:37,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299798477] [2024-11-16 12:00:37,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:37,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:37,638 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:38,204 INFO L93 Difference]: Finished difference Result 158 states and 233 transitions. [2024-11-16 12:00:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:38,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-16 12:00:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:38,209 INFO L225 Difference]: With dead ends: 158 [2024-11-16 12:00:38,209 INFO L226 Difference]: Without dead ends: 107 [2024-11-16 12:00:38,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:38,211 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 50 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:38,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 212 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:00:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-16 12:00:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2024-11-16 12:00:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:00:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 129 transitions. [2024-11-16 12:00:38,240 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 129 transitions. Word has length 111 [2024-11-16 12:00:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:38,240 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 129 transitions. [2024-11-16 12:00:38,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 129 transitions. [2024-11-16 12:00:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 12:00:38,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:38,242 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:38,250 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 12:00:38,443 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 12:00:38,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:38,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1451620069, now seen corresponding path program 1 times [2024-11-16 12:00:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:38,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019724087] [2024-11-16 12:00:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:38,446 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 12:00:38,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:38,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:38,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 12:00:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:38,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 12:00:38,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 12:00:38,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:00:38,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:38,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019724087] [2024-11-16 12:00:38,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019724087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:00:38,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:00:38,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:00:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852992510] [2024-11-16 12:00:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:00:38,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:00:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:00:38,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:00:38,926 INFO L87 Difference]: Start difference. First operand 88 states and 129 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:39,189 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2024-11-16 12:00:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:00:39,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-11-16 12:00:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:39,193 INFO L225 Difference]: With dead ends: 143 [2024-11-16 12:00:39,193 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 12:00:39,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:00:39,194 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 61 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:39,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 12:00:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-16 12:00:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:00:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-11-16 12:00:39,212 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 112 [2024-11-16 12:00:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:39,213 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-11-16 12:00:39,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 12:00:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-11-16 12:00:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 12:00:39,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:39,215 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:39,223 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 12:00:39,415 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 12:00:39,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1183889999, now seen corresponding path program 1 times [2024-11-16 12:00:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702837957] [2024-11-16 12:00:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:39,417 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 12:00:39,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:39,421 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 12:00:39,423 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 12:00:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:39,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 12:00:39,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:00:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-16 12:00:39,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:00:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-16 12:00:39,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:00:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702837957] [2024-11-16 12:00:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702837957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:00:40,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:00:40,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-16 12:00:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093945014] [2024-11-16 12:00:40,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:00:40,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:00:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:00:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:00:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:00:40,002 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-16 12:00:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:00:40,316 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions. [2024-11-16 12:00:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 12:00:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 113 [2024-11-16 12:00:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:00:40,322 INFO L225 Difference]: With dead ends: 155 [2024-11-16 12:00:40,323 INFO L226 Difference]: Without dead ends: 104 [2024-11-16 12:00:40,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-16 12:00:40,326 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 117 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:00:40,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 114 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:00:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-16 12:00:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2024-11-16 12:00:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 12:00:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 131 transitions. [2024-11-16 12:00:40,356 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 131 transitions. Word has length 113 [2024-11-16 12:00:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:00:40,356 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 131 transitions. [2024-11-16 12:00:40,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-16 12:00:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 131 transitions. [2024-11-16 12:00:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 12:00:40,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:00:40,359 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:40,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 12:00:40,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:00:40,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:00:40,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:00:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1516891151, now seen corresponding path program 1 times [2024-11-16 12:00:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:00:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756705001] [2024-11-16 12:00:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:00:40,561 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 12:00:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:00:40,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:00:40,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 12:00:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:00:40,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 12:00:40,683 INFO L278 TraceCheckSpWp]: Computing forward predicates...