./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.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 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:54:23,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:54:23,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:54:23,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:54:23,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:54:23,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:54:23,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:54:23,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:54:23,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:54:23,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:54:23,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:54:23,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:54:23,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:54:23,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:54:23,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:54:23,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:54:23,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:54:23,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:54:23,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:54:23,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:54:23,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:54:23,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:54:23,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:54:23,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:54:23,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:54:23,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:54:23,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:54:23,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:54:23,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:54:23,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:54:23,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:54:23,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:54:23,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:23,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:54:23,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:54:23,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:54:23,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:54:23,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:54:23,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:54:23,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:54:23,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:54:23,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:54:23,277 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 -> 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c [2024-11-08 22:54:23,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:54:23,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:54:23,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:54:23,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:54:23,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:54:23,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-08 22:54:24,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:54:25,142 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:54:25,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-08 22:54:25,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596b0a9bd/4abb5fe290414df3bbd2e80b8c66e1c6/FLAGf51ac336f [2024-11-08 22:54:25,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596b0a9bd/4abb5fe290414df3bbd2e80b8c66e1c6 [2024-11-08 22:54:25,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:54:25,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:54:25,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:25,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:54:25,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:54:25,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:25,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2346323d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25, skipping insertion in model container [2024-11-08 22:54:25,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:25,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:54:25,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-08 22:54:25,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:25,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:54:25,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-08 22:54:25,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:25,886 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:54:25,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25 WrapperNode [2024-11-08 22:54:25,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:25,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:25,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:54:25,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:54:25,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:25,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:25,983 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-08 22:54:25,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:25,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:54:25,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:54:25,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:54:25,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:25,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:25,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,032 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-08 22:54:26,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:54:26,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:54:26,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:54:26,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:54:26,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (1/1) ... [2024-11-08 22:54:26,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:26,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:26,100 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-08 22:54:26,102 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-08 22:54:26,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:54:26,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:54:26,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:54:26,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:54:26,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:54:26,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:54:26,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:54:26,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:54:26,531 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 22:54:26,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:54:26,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:54:26,550 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:54:26,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:26 BoogieIcfgContainer [2024-11-08 22:54:26,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:54:26,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:54:26,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:54:26,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:54:26,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:54:25" (1/3) ... [2024-11-08 22:54:26,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2b18d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:26, skipping insertion in model container [2024-11-08 22:54:26,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:25" (2/3) ... [2024-11-08 22:54:26,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2b18d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:26, skipping insertion in model container [2024-11-08 22:54:26,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:26" (3/3) ... [2024-11-08 22:54:26,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-08 22:54:26,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:54:26,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:54:26,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:54:26,654 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;@267ae582, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:54:26,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:54:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:54:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 22:54:26,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:26,677 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:26,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:26,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash 760726303, now seen corresponding path program 1 times [2024-11-08 22:54:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474010008] [2024-11-08 22:54:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:54:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:54:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:54:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:54:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:54:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:54:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:54:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:54:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:54:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:54:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:54:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:54:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:54:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:54:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:54:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:54:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:54:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:54:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:54:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:54:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:54:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:54:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:54:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:54:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:54:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:54:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:54:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:54:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:54:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474010008] [2024-11-08 22:54:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474010008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:27,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:27,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:54:27,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005354380] [2024-11-08 22:54:27,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:54:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:54:27,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:54:27,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:54:27,225 INFO L87 Difference]: Start difference. First operand has 77 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:54:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:27,261 INFO L93 Difference]: Finished difference Result 147 states and 253 transitions. [2024-11-08 22:54:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:54:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2024-11-08 22:54:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:27,272 INFO L225 Difference]: With dead ends: 147 [2024-11-08 22:54:27,272 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 22:54:27,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:54:27,280 INFO L432 NwaCegarLoop]: 109 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, 109 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-08 22:54:27,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:54:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 22:54:27,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 22:54:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:54:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-08 22:54:27,339 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 170 [2024-11-08 22:54:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:27,339 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-08 22:54:27,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:54:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-08 22:54:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 22:54:27,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:27,346 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:27,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:54:27,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:27,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -673320403, now seen corresponding path program 1 times [2024-11-08 22:54:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:27,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933670870] [2024-11-08 22:54:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:54:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:54:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:54:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:54:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:54:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:54:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:54:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:54:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:54:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:54:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:54:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:54:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:54:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:54:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:54:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:54:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:54:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:54:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:54:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:54:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:54:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:54:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:54:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:27,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:54:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:54:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:54:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:54:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:54:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:54:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933670870] [2024-11-08 22:54:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933670870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:28,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:28,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:54:28,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783292401] [2024-11-08 22:54:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:28,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:54:28,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:54:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:54:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:54:28,056 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:28,304 INFO L93 Difference]: Finished difference Result 223 states and 332 transitions. [2024-11-08 22:54:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:54:28,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2024-11-08 22:54:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:28,308 INFO L225 Difference]: With dead ends: 223 [2024-11-08 22:54:28,308 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 22:54:28,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:54:28,314 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 84 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:28,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 308 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:54:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 22:54:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2024-11-08 22:54:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 86 states have internal predecessors, (106), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:54:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-11-08 22:54:28,349 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 170 [2024-11-08 22:54:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:28,350 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-11-08 22:54:28,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-11-08 22:54:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 22:54:28,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:28,353 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:28,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:54:28,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:28,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash -817549831, now seen corresponding path program 1 times [2024-11-08 22:54:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:28,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808021603] [2024-11-08 22:54:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:54:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:54:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:54:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:54:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:54:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:54:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:54:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:54:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:54:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:54:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:54:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:54:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:54:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:54:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:54:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:54:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:54:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:54:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:54:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:54:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:54:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:54:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:54:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:54:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:54:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:54:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:54:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:54:28,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:54:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808021603] [2024-11-08 22:54:28,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808021603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:28,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:28,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:54:28,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469225232] [2024-11-08 22:54:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:28,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:54:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:54:28,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:54:28,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:54:28,649 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:28,709 INFO L93 Difference]: Finished difference Result 423 states and 636 transitions. [2024-11-08 22:54:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:54:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-11-08 22:54:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:28,714 INFO L225 Difference]: With dead ends: 423 [2024-11-08 22:54:28,715 INFO L226 Difference]: Without dead ends: 283 [2024-11-08 22:54:28,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-08 22:54:28,717 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:28,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:54:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-08 22:54:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2024-11-08 22:54:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 166 states have (on average 1.2048192771084338) internal successors, (200), 166 states have internal predecessors, (200), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-08 22:54:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 416 transitions. [2024-11-08 22:54:28,773 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 416 transitions. Word has length 172 [2024-11-08 22:54:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:28,774 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 416 transitions. [2024-11-08 22:54:28,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 416 transitions. [2024-11-08 22:54:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 22:54:28,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:28,777 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:28,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:54:28,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash -263999209, now seen corresponding path program 1 times [2024-11-08 22:54:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93822473] [2024-11-08 22:54:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:54:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:54:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:54:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:54:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:54:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:54:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:54:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:54:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:54:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:54:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:54:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:54:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:54:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:54:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:54:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:54:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:54:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:54:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:54:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 22:54:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:54:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 22:54:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:54:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 22:54:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:54:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 22:54:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 22:54:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 22:54:29,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:54:29,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93822473] [2024-11-08 22:54:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93822473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:54:29,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984375399] [2024-11-08 22:54:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:29,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:54:29,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:29,409 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-08 22:54:29,411 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-08 22:54:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:29,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 22:54:29,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:54:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-08 22:54:29,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:54:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 22:54:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984375399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:54:30,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:54:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 22:54:30,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499471360] [2024-11-08 22:54:30,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:54:30,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 22:54:30,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:54:30,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 22:54:30,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:54:30,250 INFO L87 Difference]: Start difference. First operand 279 states and 416 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 22:54:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:30,931 INFO L93 Difference]: Finished difference Result 883 states and 1291 transitions. [2024-11-08 22:54:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 22:54:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 173 [2024-11-08 22:54:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:30,940 INFO L225 Difference]: With dead ends: 883 [2024-11-08 22:54:30,940 INFO L226 Difference]: Without dead ends: 607 [2024-11-08 22:54:30,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2024-11-08 22:54:30,943 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 185 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:30,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 445 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:54:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-08 22:54:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 295. [2024-11-08 22:54:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 178 states have (on average 1.1685393258426966) internal successors, (208), 178 states have internal predecessors, (208), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-08 22:54:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 424 transitions. [2024-11-08 22:54:31,008 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 424 transitions. Word has length 173 [2024-11-08 22:54:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:31,009 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 424 transitions. [2024-11-08 22:54:31,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 22:54:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 424 transitions. [2024-11-08 22:54:31,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 22:54:31,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:31,011 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:31,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:54:31,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:54:31,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:31,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1275116459, now seen corresponding path program 1 times [2024-11-08 22:54:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:54:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056256169] [2024-11-08 22:54:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:54:31,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618302668] [2024-11-08 22:54:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:31,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:54:31,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:31,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:54:31,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 22:54:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:54:31,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:54:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:54:31,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:54:31,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:54:31,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:54:31,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 22:54:32,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:54:32,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 22:54:32,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:54:32,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:54:32 BoogieIcfgContainer [2024-11-08 22:54:32,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:54:32,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:54:32,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:54:32,174 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:54:32,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:26" (3/4) ... [2024-11-08 22:54:32,177 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:54:32,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:54:32,180 INFO L158 Benchmark]: Toolchain (without parser) took 6648.77ms. Allocated memory was 142.6MB in the beginning and 224.4MB in the end (delta: 81.8MB). Free memory was 88.8MB in the beginning and 147.7MB in the end (delta: -58.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-08 22:54:32,182 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 142.6MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:54:32,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.17ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 71.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 22:54:32,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.39ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 71.9MB in the beginning and 155.0MB in the end (delta: -83.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-08 22:54:32,182 INFO L158 Benchmark]: Boogie Preprocessor took 72.96ms. Allocated memory is still 186.6MB. Free memory was 155.0MB in the beginning and 146.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 22:54:32,182 INFO L158 Benchmark]: RCFGBuilder took 492.40ms. Allocated memory is still 186.6MB. Free memory was 146.8MB in the beginning and 123.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 22:54:32,183 INFO L158 Benchmark]: TraceAbstraction took 5620.26ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 122.7MB in the beginning and 148.7MB in the end (delta: -26.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-08 22:54:32,183 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 224.4MB. Free memory was 148.7MB in the beginning and 147.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:54:32,185 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.09ms. Allocated memory is still 142.6MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.17ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 71.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.39ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 71.9MB in the beginning and 155.0MB in the end (delta: -83.1MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.96ms. Allocated memory is still 186.6MB. Free memory was 155.0MB in the beginning and 146.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 492.40ms. Allocated memory is still 186.6MB. Free memory was 146.8MB in the beginning and 123.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5620.26ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 122.7MB in the beginning and 148.7MB in the end (delta: -26.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 224.4MB. Free memory was 148.7MB in the beginning and 147.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of shiftLeft at line 138, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 50; [L27] double var_1_9 = 32.7; [L28] double var_1_10 = 64.25; [L29] double var_1_11 = 10.3; [L30] double var_1_12 = 3.3; [L31] double var_1_13 = 16.5; [L32] double var_1_14 = 7.125; [L33] unsigned short int var_1_15 = 50; [L34] unsigned short int var_1_16 = 16; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 64; [L37] unsigned long int var_1_19 = 16; [L38] signed short int var_1_20 = 100; [L39] signed short int var_1_21 = 2; [L40] signed short int var_1_22 = 8; [L41] signed long int var_1_23 = -4; [L42] unsigned short int var_1_24 = 128; [L43] signed long int var_1_25 = 2; [L44] unsigned short int var_1_26 = 256; [L45] unsigned char var_1_27 = 0; [L46] signed long int last_1_var_1_8 = 50; [L47] unsigned long int last_1_var_1_19 = 16; [L48] unsigned char last_1_var_1_27 = 0; VAL [isInitial=0, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_19 = var_1_19 [L135] last_1_var_1_27 = var_1_27 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L145] RET updateLastVariables() [L146] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L90] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L93] var_1_6 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L94] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_8=50, var_1_9=327/10] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_8=50, var_1_9=327/10] [L98] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L98] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L99] var_1_10 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L100] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && 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_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L102] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && 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_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L104] RET assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L105] var_1_13 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L107] var_1_14 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L109] var_1_16 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L110] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L111] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L111] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L112] var_1_17 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L113] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L114] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L114] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L115] var_1_18 = __VERIFIER_nondet_ushort() [L116] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L116] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L117] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L117] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L118] var_1_20 = __VERIFIER_nondet_short() [L119] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L119] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L120] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L120] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L121] var_1_21 = __VERIFIER_nondet_short() [L122] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L122] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L123] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L123] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L124] var_1_22 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L125] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L126] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L126] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L127] var_1_24 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L128] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L129] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L129] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L130] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L130] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L146] RET updateVariables() [L147] CALL step() [L52] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L52] signed long int stepLocal_1 = -1 << last_1_var_1_19; [L53] unsigned long int stepLocal_0 = -1000000000 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, stepLocal_1=0, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L54] COND TRUE stepLocal_1 < var_1_3 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L55] COND FALSE !((last_1_var_1_19 / var_1_3) > stepLocal_0) [L58] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L61] var_1_9 = (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L62] COND TRUE var_1_10 >= var_1_11 [L63] var_1_15 = ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L65] var_1_25 = -256 [L66] var_1_26 = var_1_17 [L67] var_1_27 = var_1_6 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L68] COND FALSE !(var_1_7 || var_1_1) [L79] var_1_8 = last_1_var_1_8 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L81] COND TRUE var_1_6 || (var_1_16 <= (var_1_22 / var_1_24)) [L82] var_1_23 = (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L84] COND TRUE (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23 [L85] var_1_19 = ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L138-L139] return ((((((((((-1 << last_1_var_1_19) < var_1_3) ? (((last_1_var_1_19 / var_1_3) > (-1000000000 + last_1_var_1_19)) ? (var_1_1 == ((unsigned char) (last_1_var_1_27 || var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : 1) && ((var_1_7 || var_1_1) ? (((var_1_26 >= var_1_3) && var_1_1) ? (var_1_8 == ((signed long int) ((((var_1_3) < (var_1_26)) ? (var_1_3) : (var_1_26))))) : (var_1_1 ? (var_1_8 == ((signed long int) last_1_var_1_8)) : (var_1_8 == ((signed long int) last_1_var_1_8)))) : (var_1_8 == ((signed long int) last_1_var_1_8)))) && (var_1_9 == ((double) (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14)))))) && ((var_1_10 >= var_1_11) ? (var_1_15 == ((unsigned short int) ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))))) : 1)) && (((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23) ? (var_1_19 == ((unsigned long int) ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_6 || (var_1_16 <= (var_1_22 / var_1_24))) ? (var_1_23 == ((signed long int) (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : 1)) && (var_1_25 == ((signed long int) -256))) && (var_1_26 == ((unsigned short int) var_1_17))) && (var_1_27 == ((unsigned char) var_1_6)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 1078 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 656 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 422 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 592 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 326 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1204 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 2465 SizeOfPredicates, 2 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8217/8424 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-08 22:54:32,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.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 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:54:34,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:54:34,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:54:34,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:54:34,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:54:34,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:54:34,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:54:34,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:54:34,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:54:34,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:54:34,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:54:34,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:54:34,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:54:34,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:54:34,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:54:34,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:54:34,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:54:34,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:54:34,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:54:34,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:54:34,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:54:34,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:54:34,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:54:34,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:54:34,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:54:34,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:54:34,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:54:34,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:54:34,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:54:34,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:54:34,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:54:34,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:54:34,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:54:34,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:54:34,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:34,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:54:34,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:54:34,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:54:34,480 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:54:34,480 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:54:34,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:54:34,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:54:34,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:54:34,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:54:34,481 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 -> 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c [2024-11-08 22:54:34,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:54:34,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:54:34,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:54:34,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:54:34,830 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:54:34,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-08 22:54:36,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:54:36,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:54:36,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-08 22:54:36,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f869bba86/9976a0f1406c4eb7b7e0a48a48e5d79e/FLAG943bb9fc3 [2024-11-08 22:54:36,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f869bba86/9976a0f1406c4eb7b7e0a48a48e5d79e [2024-11-08 22:54:36,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:54:36,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:54:36,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:36,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:54:36,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:54:36,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:36,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9b5dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36, skipping insertion in model container [2024-11-08 22:54:36,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:36,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:54:36,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-08 22:54:36,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:36,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:54:36,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-08 22:54:36,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:36,976 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:54:36,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36 WrapperNode [2024-11-08 22:54:36,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:36,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:36,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:54:36,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:54:36,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,037 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-08 22:54:37,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:37,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:54:37,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:54:37,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:54:37,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,073 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-08 22:54:37,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:54:37,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:54:37,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:54:37,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:54:37,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (1/1) ... [2024-11-08 22:54:37,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:37,146 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-08 22:54:37,152 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-08 22:54:37,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:54:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:54:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:54:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:54:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:54:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:54:37,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:54:37,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:54:39,485 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 22:54:39,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:54:39,497 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:54:39,497 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:54:39,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:39 BoogieIcfgContainer [2024-11-08 22:54:39,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:54:39,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:54:39,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:54:39,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:54:39,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:54:36" (1/3) ... [2024-11-08 22:54:39,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abf74fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:39, skipping insertion in model container [2024-11-08 22:54:39,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:36" (2/3) ... [2024-11-08 22:54:39,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abf74fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:39, skipping insertion in model container [2024-11-08 22:54:39,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:39" (3/3) ... [2024-11-08 22:54:39,506 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-08 22:54:39,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:54:39,522 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:54:39,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:54:39,613 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;@202b43c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:54:39,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:54:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:54:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 22:54:39,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:39,635 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:39,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:39,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -11235031, now seen corresponding path program 1 times [2024-11-08 22:54:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:54:39,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485093048] [2024-11-08 22:54:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:39,654 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-08 22:54:39,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:54:39,656 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-08 22:54:39,658 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-08 22:54:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:40,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:54:40,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:54:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-08 22:54:40,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:54:40,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:54:40,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485093048] [2024-11-08 22:54:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485093048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:40,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:40,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:54:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525562971] [2024-11-08 22:54:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:54:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:54:40,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:54:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:54:40,250 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:54:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:40,283 INFO L93 Difference]: Finished difference Result 135 states and 237 transitions. [2024-11-08 22:54:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:54:40,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 166 [2024-11-08 22:54:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:40,294 INFO L225 Difference]: With dead ends: 135 [2024-11-08 22:54:40,294 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 22:54:40,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-08 22:54:40,300 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:40,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:54:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 22:54:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 22:54:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 22:54:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-08 22:54:40,344 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 166 [2024-11-08 22:54:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:40,344 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-08 22:54:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:54:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-08 22:54:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 22:54:40,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:40,348 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:40,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:54:40,548 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-08 22:54:40,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:40,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash -914852041, now seen corresponding path program 1 times [2024-11-08 22:54:40,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:54:40,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762774297] [2024-11-08 22:54:40,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:40,551 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-08 22:54:40,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:54:40,553 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-08 22:54:40,555 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-08 22:54:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:40,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:54:40,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:54:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-08 22:54:41,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:54:41,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:54:41,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762774297] [2024-11-08 22:54:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762774297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:54:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521402354] [2024-11-08 22:54:41,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:41,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:54:41,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:54:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:54:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:54:41,885 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:44,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:54:46,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:54:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:46,689 INFO L93 Difference]: Finished difference Result 202 states and 304 transitions. [2024-11-08 22:54:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:54:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 166 [2024-11-08 22:54:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:46,720 INFO L225 Difference]: With dead ends: 202 [2024-11-08 22:54:46,720 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 22:54:46,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:54:46,723 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 68 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:46,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 387 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-08 22:54:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 22:54:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2024-11-08 22:54:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:54:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2024-11-08 22:54:46,760 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 166 [2024-11-08 22:54:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:46,761 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2024-11-08 22:54:46,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-08 22:54:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2024-11-08 22:54:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:54:46,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:46,765 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:46,781 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-08 22:54:46,965 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-08 22:54:46,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:46,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1950862965, now seen corresponding path program 1 times [2024-11-08 22:54:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:54:46,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142363587] [2024-11-08 22:54:46,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:46,968 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-08 22:54:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:54:46,971 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-08 22:54:46,972 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-08 22:54:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:47,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 22:54:47,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:54:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-08 22:54:48,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:54:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-08 22:54:48,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:54:48,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142363587] [2024-11-08 22:54:48,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142363587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:54:48,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:54:48,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 22:54:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11294837] [2024-11-08 22:54:48,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:54:48,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:54:48,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:54:48,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:54:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:54:48,690 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 22:54:51,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:54:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:52,490 INFO L93 Difference]: Finished difference Result 537 states and 799 transitions. [2024-11-08 22:54:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 22:54:52,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 167 [2024-11-08 22:54:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:52,496 INFO L225 Difference]: With dead ends: 537 [2024-11-08 22:54:52,496 INFO L226 Difference]: Without dead ends: 411 [2024-11-08 22:54:52,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2024-11-08 22:54:52,498 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 208 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:52,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 244 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 22:54:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-08 22:54:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 210. [2024-11-08 22:54:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 122 states have (on average 1.1885245901639345) internal successors, (145), 122 states have internal predecessors, (145), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-08 22:54:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2024-11-08 22:54:52,560 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 167 [2024-11-08 22:54:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:52,561 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2024-11-08 22:54:52,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-08 22:54:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2024-11-08 22:54:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:54:52,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:52,564 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:52,584 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-08 22:54:52,764 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-08 22:54:52,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1249798387, now seen corresponding path program 1 times [2024-11-08 22:54:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:54:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38739007] [2024-11-08 22:54:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:52,766 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-08 22:54:52,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:54:52,769 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-08 22:54:52,771 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-08 22:54:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:53,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 22:54:53,309 INFO L278 TraceCheckSpWp]: Computing forward predicates...