./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.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 c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:49:23,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:49:23,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:49:23,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:49:23,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:49:23,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:49:23,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:49:23,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:49:23,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:49:23,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:49:23,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:49:23,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:49:23,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:49:23,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:49:23,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:49:23,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:49:23,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:49:23,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:49:23,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:49:23,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:49:23,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:49:23,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:49:23,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:49:23,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:49:23,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:49:23,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:49:23,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:49:23,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:49:23,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:49:23,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:49:23,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:49:23,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:49:23,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:49:23,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:49:23,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:49:23,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:49:23,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:49:23,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:49:23,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:49:23,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:49:23,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:49:23,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:49:23,981 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 -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2024-11-20 02:49:24,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:49:24,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:49:24,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:49:24,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:49:24,193 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:49:24,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-20 02:49:25,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:49:25,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:49:25,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-20 02:49:25,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0790d2156/6b035de0b8c34ef0bddd65985771d507/FLAGea8729157 [2024-11-20 02:49:25,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0790d2156/6b035de0b8c34ef0bddd65985771d507 [2024-11-20 02:49:25,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:49:25,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:49:25,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:49:25,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:49:25,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:49:25,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:49:25" (1/1) ... [2024-11-20 02:49:25,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d787561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:25, skipping insertion in model container [2024-11-20 02:49:25,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:49:25" (1/1) ... [2024-11-20 02:49:25,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:49:26,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-20 02:49:26,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:49:26,188 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:49:26,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-20 02:49:26,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:49:26,230 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:49:26,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26 WrapperNode [2024-11-20 02:49:26,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:49:26,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:49:26,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:49:26,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:49:26,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,284 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-20 02:49:26,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:49:26,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:49:26,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:49:26,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:49:26,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,317 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:49:26,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:49:26,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:49:26,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:49:26,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:49:26,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (1/1) ... [2024-11-20 02:49:26,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:49:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:49:26,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:49:26,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:49:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:49:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:49:26,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:49:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:49:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:49:26,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:49:26,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:49:26,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:49:26,694 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 02:49:26,695 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:49:26,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:49:26,704 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:49:26,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:49:26 BoogieIcfgContainer [2024-11-20 02:49:26,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:49:26,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:49:26,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:49:26,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:49:26,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:49:25" (1/3) ... [2024-11-20 02:49:26,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74837d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:49:26, skipping insertion in model container [2024-11-20 02:49:26,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:26" (2/3) ... [2024-11-20 02:49:26,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74837d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:49:26, skipping insertion in model container [2024-11-20 02:49:26,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:49:26" (3/3) ... [2024-11-20 02:49:26,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-20 02:49:26,723 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:49:26,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:49:26,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:49:26,796 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;@144ba75f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:49:26,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:49:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:49:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 02:49:26,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:26,814 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:26,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:26,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1402951041, now seen corresponding path program 1 times [2024-11-20 02:49:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891728939] [2024-11-20 02:49:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:49:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:49:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:49:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:49:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:49:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:49:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:49:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:49:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:49:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:49:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:49:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:49:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 02:49:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:49:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 02:49:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:49:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 02:49:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 02:49:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:49:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 02:49:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:49:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891728939] [2024-11-20 02:49:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891728939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:49:27,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:49:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:49:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771909357] [2024-11-20 02:49:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:49:27,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:49:27,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:49:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:49:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:49:27,186 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:49:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:27,209 INFO L93 Difference]: Finished difference Result 117 states and 201 transitions. [2024-11-20 02:49:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:49:27,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-20 02:49:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:27,218 INFO L225 Difference]: With dead ends: 117 [2024-11-20 02:49:27,219 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 02:49:27,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:49:27,226 INFO L432 NwaCegarLoop]: 87 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, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:27,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:49:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 02:49:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-20 02:49:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:49:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-11-20 02:49:27,266 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2024-11-20 02:49:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:27,267 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-11-20 02:49:27,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:49:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-11-20 02:49:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 02:49:27,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:27,273 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:27,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:49:27,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:27,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1225521275, now seen corresponding path program 1 times [2024-11-20 02:49:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:27,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394282502] [2024-11-20 02:49:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:49:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:49:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:49:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:49:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:49:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:49:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:49:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:49:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:49:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:49:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:49:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:49:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 02:49:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:49:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 02:49:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:49:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 02:49:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 02:49:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:49:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 02:49:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:49:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394282502] [2024-11-20 02:49:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394282502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:49:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:49:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:49:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509891643] [2024-11-20 02:49:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:49:27,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:49:27,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:49:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:49:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:49:27,572 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:49:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:27,622 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2024-11-20 02:49:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:49:27,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-20 02:49:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:27,625 INFO L225 Difference]: With dead ends: 168 [2024-11-20 02:49:27,626 INFO L226 Difference]: Without dead ends: 113 [2024-11-20 02:49:27,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-20 02:49:27,628 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:27,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 160 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:49:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-20 02:49:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-11-20 02:49:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 02:49:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2024-11-20 02:49:27,657 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 123 [2024-11-20 02:49:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:27,660 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2024-11-20 02:49:27,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:49:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2024-11-20 02:49:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 02:49:27,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:27,663 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:27,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:49:27,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:27,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 549486087, now seen corresponding path program 1 times [2024-11-20 02:49:27,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704706791] [2024-11-20 02:49:27,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:49:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:49:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:49:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:49:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:49:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:49:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:49:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:49:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:49:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:49:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:49:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:49:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 02:49:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:49:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 02:49:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 02:49:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 02:49:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 02:49:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:49:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-20 02:49:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:49:27,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704706791] [2024-11-20 02:49:27,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704706791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:49:27,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683518168] [2024-11-20 02:49:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:27,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:49:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:49:27,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:49:27,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:49:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:28,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 02:49:28,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:49:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-20 02:49:28,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:49:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-20 02:49:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683518168] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:49:28,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:49:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 02:49:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636784939] [2024-11-20 02:49:28,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:49:28,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:49:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:49:28,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:49:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:49:28,348 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 02:49:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:28,611 INFO L93 Difference]: Finished difference Result 255 states and 381 transitions. [2024-11-20 02:49:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:49:28,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 123 [2024-11-20 02:49:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:28,616 INFO L225 Difference]: With dead ends: 255 [2024-11-20 02:49:28,616 INFO L226 Difference]: Without dead ends: 148 [2024-11-20 02:49:28,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:49:28,619 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:28,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 219 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:49:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-20 02:49:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2024-11-20 02:49:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 85 states have internal predecessors, (104), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 02:49:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-11-20 02:49:28,641 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 123 [2024-11-20 02:49:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:28,642 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-11-20 02:49:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 02:49:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-11-20 02:49:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 02:49:28,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:28,643 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:28,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:49:28,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:49:28,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash -219419195, now seen corresponding path program 1 times [2024-11-20 02:49:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458981489] [2024-11-20 02:49:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:28,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:49:28,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:49:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:49:28,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:49:28,973 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:49:28,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:49:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:49:28,978 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 02:49:29,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:49:29,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:49:29 BoogieIcfgContainer [2024-11-20 02:49:29,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:49:29,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:49:29,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:49:29,072 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:49:29,072 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:49:26" (3/4) ... [2024-11-20 02:49:29,074 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:49:29,075 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:49:29,075 INFO L158 Benchmark]: Toolchain (without parser) took 3109.80ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 76.2MB in the beginning and 153.1MB in the end (delta: -76.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:49:29,076 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:49:29,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.79ms. Allocated memory is still 130.0MB. Free memory was 75.9MB in the beginning and 60.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 02:49:29,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.85ms. Allocated memory is still 130.0MB. Free memory was 103.4MB in the beginning and 99.7MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:49:29,076 INFO L158 Benchmark]: Boogie Preprocessor took 49.57ms. Allocated memory is still 130.0MB. Free memory was 99.7MB in the beginning and 94.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:49:29,077 INFO L158 Benchmark]: RCFGBuilder took 368.16ms. Allocated memory is still 130.0MB. Free memory was 94.6MB in the beginning and 74.6MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 02:49:29,077 INFO L158 Benchmark]: TraceAbstraction took 2365.85ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 73.6MB in the beginning and 153.1MB in the end (delta: -79.5MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2024-11-20 02:49:29,077 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 188.7MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:49:29,078 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.14ms. Allocated memory is still 130.0MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.79ms. Allocated memory is still 130.0MB. Free memory was 75.9MB in the beginning and 60.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.85ms. Allocated memory is still 130.0MB. Free memory was 103.4MB in the beginning and 99.7MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.57ms. Allocated memory is still 130.0MB. Free memory was 99.7MB in the beginning and 94.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 368.16ms. Allocated memory is still 130.0MB. Free memory was 94.6MB in the beginning and 74.6MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2365.85ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 73.6MB in the beginning and 153.1MB in the end (delta: -79.5MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 188.7MB. Free memory is still 153.1MB. 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 someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] unsigned char last_1_var_1_1 = 2; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_15 = var_1_15 [L127] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L104] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L107] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L109] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L110] var_1_12 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L111] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L116] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L121] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L138] RET updateVariables() [L139] CALL step() [L48] COND FALSE !(var_1_5 >= var_1_6) [L57] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L59] unsigned char stepLocal_1 = var_1_15; [L60] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L61] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L62] COND TRUE var_1_15 && stepLocal_1 [L63] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L68] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L77] COND TRUE var_1_11 == var_1_18 [L78] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L80] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L83] COND TRUE (var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5 [L84] var_1_9 = ((4.5f + var_1_11) - var_1_12) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L88] var_1_22 = var_1_12 [L89] var_1_23 = var_1_8 [L90] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 466 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 258 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3384/3420 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-20 02:49:29,101 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.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 c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:49:30,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:49:30,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:49:30,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:49:30,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:49:30,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:49:30,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:49:30,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:49:30,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:49:30,956 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:49:30,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:49:30,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:49:30,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:49:30,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:49:30,957 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:49:30,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:49:30,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:49:30,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:49:30,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:49:30,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:49:30,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:49:30,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:49:30,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:49:30,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:49:30,961 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:49:30,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:49:30,962 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:49:30,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:49:30,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:49:30,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:49:30,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:49:30,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:49:30,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:49:30,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:49:30,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:49:30,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:49:30,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:49:30,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:49:30,978 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:49:30,978 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:49:30,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:49:30,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:49:30,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:49:30,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:49:30,980 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 -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2024-11-20 02:49:31,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:49:31,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:49:31,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:49:31,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:49:31,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:49:31,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-20 02:49:32,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:49:32,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:49:32,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-20 02:49:32,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295ba1f7a/7f980e72d89b442ba1a47dd9664918a2/FLAG8e97464f0 [2024-11-20 02:49:32,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295ba1f7a/7f980e72d89b442ba1a47dd9664918a2 [2024-11-20 02:49:32,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:49:32,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:49:32,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:49:32,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:49:32,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:49:32,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:49:32" (1/1) ... [2024-11-20 02:49:32,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5283296f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:32, skipping insertion in model container [2024-11-20 02:49:32,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:49:32" (1/1) ... [2024-11-20 02:49:32,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:49:32,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-20 02:49:32,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:49:32,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:49:32,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-20 02:49:32,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:49:33,005 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:49:33,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33 WrapperNode [2024-11-20 02:49:33,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:49:33,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:49:33,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:49:33,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:49:33,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,040 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-20 02:49:33,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:49:33,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:49:33,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:49:33,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:49:33,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:49:33,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:49:33,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:49:33,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:49:33,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:49:33,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (1/1) ... [2024-11-20 02:49:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:49:33,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:49:33,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:49:33,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:49:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:49:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:49:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:49:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:49:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:49:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:49:33,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:49:33,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:49:35,841 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 02:49:35,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:49:35,855 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:49:35,855 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:49:35,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:49:35 BoogieIcfgContainer [2024-11-20 02:49:35,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:49:35,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:49:35,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:49:35,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:49:35,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:49:32" (1/3) ... [2024-11-20 02:49:35,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee13e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:49:35, skipping insertion in model container [2024-11-20 02:49:35,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:33" (2/3) ... [2024-11-20 02:49:35,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee13e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:49:35, skipping insertion in model container [2024-11-20 02:49:35,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:49:35" (3/3) ... [2024-11-20 02:49:35,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-20 02:49:35,887 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:49:35,888 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:49:35,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:49:35,943 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;@72593cf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:49:35,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:49:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:49:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 02:49:35,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:35,955 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:35,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:35,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:35,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1402951041, now seen corresponding path program 1 times [2024-11-20 02:49:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:49:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838106327] [2024-11-20 02:49:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:35,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:49:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:49:35,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:49:35,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:49:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:36,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:49:36,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:49:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-20 02:49:36,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:49:36,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:49:36,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838106327] [2024-11-20 02:49:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838106327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:49:36,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:49:36,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:49:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117062719] [2024-11-20 02:49:36,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:49:36,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:49:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:49:36,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:49:36,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:49:36,319 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:49:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:36,347 INFO L93 Difference]: Finished difference Result 117 states and 201 transitions. [2024-11-20 02:49:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:49:36,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-20 02:49:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:36,357 INFO L225 Difference]: With dead ends: 117 [2024-11-20 02:49:36,358 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 02:49:36,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:49:36,364 INFO L432 NwaCegarLoop]: 87 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, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:36,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:49:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 02:49:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-20 02:49:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:49:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-11-20 02:49:36,411 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2024-11-20 02:49:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:36,412 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-11-20 02:49:36,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:49:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-11-20 02:49:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 02:49:36,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:36,415 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:36,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:49:36,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:49:36,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:36,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1225521275, now seen corresponding path program 1 times [2024-11-20 02:49:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:49:36,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973052365] [2024-11-20 02:49:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:36,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:49:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:49:36,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:49:36,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:49:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:36,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 02:49:36,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:49:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-20 02:49:37,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:49:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-20 02:49:37,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:49:37,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973052365] [2024-11-20 02:49:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973052365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:49:37,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:49:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-20 02:49:37,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458211606] [2024-11-20 02:49:37,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:49:37,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 02:49:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:49:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 02:49:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:49:37,506 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-20 02:49:39,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:49:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:40,694 INFO L93 Difference]: Finished difference Result 279 states and 403 transitions. [2024-11-20 02:49:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-20 02:49:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 123 [2024-11-20 02:49:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:40,698 INFO L225 Difference]: With dead ends: 279 [2024-11-20 02:49:40,698 INFO L226 Difference]: Without dead ends: 224 [2024-11-20 02:49:40,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2024-11-20 02:49:40,700 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 322 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:40,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 630 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 02:49:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-20 02:49:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2024-11-20 02:49:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 131 states have internal predecessors, (161), 71 states have call successors, (71), 9 states have call predecessors, (71), 9 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-20 02:49:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2024-11-20 02:49:40,741 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 123 [2024-11-20 02:49:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:40,742 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2024-11-20 02:49:40,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-20 02:49:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2024-11-20 02:49:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 02:49:40,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:40,747 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:40,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 02:49:40,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:49:40,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:40,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1994426557, now seen corresponding path program 1 times [2024-11-20 02:49:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:49:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23442770] [2024-11-20 02:49:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:49:40,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:49:40,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:49:40,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 02:49:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:41,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:49:41,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:49:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 02:49:41,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:49:41,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:49:41,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23442770] [2024-11-20 02:49:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23442770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:49:41,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:49:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:49:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122291344] [2024-11-20 02:49:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:49:41,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:49:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:49:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:49:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:49:41,492 INFO L87 Difference]: Start difference. First operand 211 states and 303 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:49:43,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:49:45,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:49:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:45,848 INFO L93 Difference]: Finished difference Result 581 states and 829 transitions. [2024-11-20 02:49:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:49:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-20 02:49:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:45,876 INFO L225 Difference]: With dead ends: 581 [2024-11-20 02:49:45,876 INFO L226 Difference]: Without dead ends: 396 [2024-11-20 02:49:45,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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-20 02:49:45,879 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:45,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-20 02:49:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-20 02:49:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 330. [2024-11-20 02:49:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 206 states have internal predecessors, (253), 109 states have call successors, (109), 15 states have call predecessors, (109), 15 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-20 02:49:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 471 transitions. [2024-11-20 02:49:45,944 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 471 transitions. Word has length 124 [2024-11-20 02:49:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:45,945 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 471 transitions. [2024-11-20 02:49:45,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:49:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2024-11-20 02:49:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 02:49:45,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:45,949 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:49:45,957 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-20 02:49:46,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:49:46,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash -219419195, now seen corresponding path program 1 times [2024-11-20 02:49:46,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:49:46,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121558550] [2024-11-20 02:49:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:46,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:49:46,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:49:46,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:49:46,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 02:49:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:46,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 02:49:46,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:49:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-20 02:49:56,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:50:15,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:50:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121558550] [2024-11-20 02:50:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121558550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:50:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1409919073] [2024-11-20 02:50:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:15,359 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 02:50:15,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 02:50:15,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 02:50:15,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 02:50:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:15,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 02:50:15,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:50:43,748 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-20 02:50:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-20 02:50:44,183 INFO L311 TraceCheckSpWp]: Computing backward predicates...