./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_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 7e259d0d348361eebf16bf1e72a5d71337e9d01f69230834d61aaa75aa741f6d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:14:34,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:14:34,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:14:34,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:14:34,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:14:34,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:14:34,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:14:34,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:14:34,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:14:34,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:14:34,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:14:34,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:14:34,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:14:34,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:14:34,825 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:14:34,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:14:34,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:14:34,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:14:34,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:14:34,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:14:34,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:14:34,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:14:34,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:14:34,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:14:34,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:14:34,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:14:34,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:14:34,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:14:34,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:14:34,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:14:34,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:14:34,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:14:34,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:14:34,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:14:34,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:14:34,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:14:34,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:14:34,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:14:34,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:14:34,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:14:34,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:14:34,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:14:34,836 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 -> 7e259d0d348361eebf16bf1e72a5d71337e9d01f69230834d61aaa75aa741f6d [2024-10-24 05:14:35,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:14:35,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:14:35,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:14:35,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:14:35,109 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:14:35,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i [2024-10-24 05:14:36,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:14:36,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:14:36,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i [2024-10-24 05:14:36,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8583c96/e13587a760be440cb66c19a57e17de0b/FLAGb0810abd8 [2024-10-24 05:14:36,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8583c96/e13587a760be440cb66c19a57e17de0b [2024-10-24 05:14:36,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:14:36,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:14:36,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:36,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:14:36,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:14:36,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:36" (1/1) ... [2024-10-24 05:14:36,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214d4eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:36, skipping insertion in model container [2024-10-24 05:14:36,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:36" (1/1) ... [2024-10-24 05:14:36,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:14:37,085 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i[919,932] [2024-10-24 05:14:37,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:37,197 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:14:37,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i[919,932] [2024-10-24 05:14:37,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:37,280 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:14:37,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37 WrapperNode [2024-10-24 05:14:37,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:37,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:37,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:14:37,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:14:37,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,401 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-10-24 05:14:37,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:37,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:14:37,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:14:37,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:14:37,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,450 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:14:37,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:14:37,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:14:37,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:14:37,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:14:37,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (1/1) ... [2024-10-24 05:14:37,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:14:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:37,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:14:37,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:14:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:14:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:14:37,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:14:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:14:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:14:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:14:37,666 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:14:37,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:14:38,020 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:14:38,020 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:14:38,087 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:14:38,088 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:14:38,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:38 BoogieIcfgContainer [2024-10-24 05:14:38,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:14:38,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:14:38,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:14:38,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:14:38,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:14:36" (1/3) ... [2024-10-24 05:14:38,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40232f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:38, skipping insertion in model container [2024-10-24 05:14:38,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:37" (2/3) ... [2024-10-24 05:14:38,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40232f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:38, skipping insertion in model container [2024-10-24 05:14:38,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:38" (3/3) ... [2024-10-24 05:14:38,100 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-94.i [2024-10-24 05:14:38,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:14:38,112 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:14:38,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:14:38,187 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;@7654f7f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:14:38,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:14:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 40 states have (on average 1.375) internal successors, (55), 41 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-10-24 05:14:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 05:14:38,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:38,205 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] [2024-10-24 05:14:38,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1647812740, now seen corresponding path program 1 times [2024-10-24 05:14:38,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:38,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527082706] [2024-10-24 05:14:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:14:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:14:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:14:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:14:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 05:14:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 05:14:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 05:14:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 05:14:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:14:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 05:14:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:14:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:14:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:14:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:14:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 05:14:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 05:14:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 05:14:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 05:14:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 05:14:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:14:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:14:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527082706] [2024-10-24 05:14:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527082706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:38,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:14:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176928525] [2024-10-24 05:14:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:38,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:14:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:38,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:14:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:14:38,802 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.375) internal successors, (55), 41 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) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (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-10-24 05:14:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:38,848 INFO L93 Difference]: Finished difference Result 137 states and 243 transitions. [2024-10-24 05:14:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:14:38,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (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 165 [2024-10-24 05:14:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:38,860 INFO L225 Difference]: With dead ends: 137 [2024-10-24 05:14:38,861 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 05:14:38,866 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-10-24 05:14:38,873 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:38,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:14:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 05:14:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 05:14:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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-10-24 05:14:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-10-24 05:14:38,938 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 165 [2024-10-24 05:14:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:38,939 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-10-24 05:14:38,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (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-10-24 05:14:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-10-24 05:14:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 05:14:38,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:38,944 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] [2024-10-24 05:14:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:14:38,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1854601738, now seen corresponding path program 1 times [2024-10-24 05:14:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694880688] [2024-10-24 05:14:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:14:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:14:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:14:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:14:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 05:14:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 05:14:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 05:14:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 05:14:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:14:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 05:14:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:14:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:14:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:14:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:14:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 05:14:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 05:14:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 05:14:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 05:14:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 05:14:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:14:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:14:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:39,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694880688] [2024-10-24 05:14:39,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694880688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:39,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:39,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:14:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104426048] [2024-10-24 05:14:39,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:14:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:39,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:14:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:14:39,584 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-10-24 05:14:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:39,674 INFO L93 Difference]: Finished difference Result 202 states and 310 transitions. [2024-10-24 05:14:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:14:39,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 165 [2024-10-24 05:14:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:39,678 INFO L225 Difference]: With dead ends: 202 [2024-10-24 05:14:39,678 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 05:14:39,679 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-10-24 05:14:39,682 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:39,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 202 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:14:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 05:14:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-10-24 05:14:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 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-10-24 05:14:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2024-10-24 05:14:39,732 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 165 [2024-10-24 05:14:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:39,733 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2024-10-24 05:14:39,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-10-24 05:14:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2024-10-24 05:14:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 05:14:39,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:39,739 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-10-24 05:14:39,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:14:39,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1705890603, now seen corresponding path program 1 times [2024-10-24 05:14:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269387709] [2024-10-24 05:14:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:14:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:14:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:14:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:14:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 05:14:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 05:14:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 05:14:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 05:14:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:14:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 05:14:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:14:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:14:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:14:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:14:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 05:14:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 05:14:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 05:14:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 05:14:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 05:14:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:14:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:14:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:40,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269387709] [2024-10-24 05:14:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269387709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:40,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:40,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:14:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267110335] [2024-10-24 05:14:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:40,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:14:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:14:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:14:40,364 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand has 4 states, 4 states have (on average 8.5) 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-10-24 05:14:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:40,613 INFO L93 Difference]: Finished difference Result 427 states and 653 transitions. [2024-10-24 05:14:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:14:40,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) 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-10-24 05:14:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:40,623 INFO L225 Difference]: With dead ends: 427 [2024-10-24 05:14:40,624 INFO L226 Difference]: Without dead ends: 296 [2024-10-24 05:14:40,627 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-10-24 05:14:40,629 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 104 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:40,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 304 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:14:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-24 05:14:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 284. [2024-10-24 05:14:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 171 states have (on average 1.2748538011695907) internal successors, (218), 171 states have internal predecessors, (218), 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-10-24 05:14:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 434 transitions. [2024-10-24 05:14:40,718 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 434 transitions. Word has length 166 [2024-10-24 05:14:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:40,720 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 434 transitions. [2024-10-24 05:14:40,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) 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-10-24 05:14:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 434 transitions. [2024-10-24 05:14:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:14:40,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:40,726 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] [2024-10-24 05:14:40,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:14:40,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:40,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -877094370, now seen corresponding path program 1 times [2024-10-24 05:14:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689556204] [2024-10-24 05:14:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:14:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:14:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:14:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:14:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 05:14:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 05:14:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 05:14:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 05:14:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:14:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 05:14:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:14:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 05:14:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:14:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:14:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 05:14:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 05:14:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 05:14:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 05:14:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 05:14:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:14:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-24 05:14:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689556204] [2024-10-24 05:14:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689556204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:14:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065171472] [2024-10-24 05:14:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:41,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:41,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:14:41,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:14:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:41,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 05:14:41,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:14:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-24 05:14:41,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:14:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-24 05:14:42,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065171472] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:14:42,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:14:42,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-24 05:14:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280536010] [2024-10-24 05:14:42,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:14:42,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 05:14:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 05:14:42,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:14:42,241 INFO L87 Difference]: Start difference. First operand 284 states and 434 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-10-24 05:14:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:42,999 INFO L93 Difference]: Finished difference Result 903 states and 1353 transitions. [2024-10-24 05:14:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 05:14:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 168 [2024-10-24 05:14:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:43,005 INFO L225 Difference]: With dead ends: 903 [2024-10-24 05:14:43,005 INFO L226 Difference]: Without dead ends: 620 [2024-10-24 05:14:43,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2024-10-24 05:14:43,008 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 214 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:43,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 306 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:14:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-10-24 05:14:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 300. [2024-10-24 05:14:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 183 states have (on average 1.2240437158469946) internal successors, (224), 183 states have internal predecessors, (224), 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-10-24 05:14:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 440 transitions. [2024-10-24 05:14:43,081 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 440 transitions. Word has length 168 [2024-10-24 05:14:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:43,084 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 440 transitions. [2024-10-24 05:14:43,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-10-24 05:14:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 440 transitions. [2024-10-24 05:14:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 05:14:43,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:43,086 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] [2024-10-24 05:14:43,106 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-10-24 05:14:43,287 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-10-24 05:14:43,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:43,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1463900384, now seen corresponding path program 1 times [2024-10-24 05:14:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:43,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070525716] [2024-10-24 05:14:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:14:43,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102958624] [2024-10-24 05:14:43,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:43,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:43,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:43,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:14:43,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 05:14:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:14:43,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:14:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:14:43,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:14:43,688 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:14:43,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:14:43,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 05:14:43,891 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-10-24 05:14:43,894 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 05:14:44,017 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:14:44,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:14:44 BoogieIcfgContainer [2024-10-24 05:14:44,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:14:44,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:14:44,022 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:14:44,022 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:14:44,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:38" (3/4) ... [2024-10-24 05:14:44,024 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:14:44,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:14:44,026 INFO L158 Benchmark]: Toolchain (without parser) took 7158.18ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 115.4MB in the beginning and 141.7MB in the end (delta: -26.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-24 05:14:44,026 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:14:44,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.60ms. Allocated memory is still 182.5MB. Free memory was 115.2MB in the beginning and 154.1MB in the end (delta: -38.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-24 05:14:44,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.14ms. Allocated memory is still 182.5MB. Free memory was 154.1MB in the beginning and 149.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:14:44,027 INFO L158 Benchmark]: Boogie Preprocessor took 72.75ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 141.9MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 05:14:44,027 INFO L158 Benchmark]: RCFGBuilder took 607.40ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 113.2MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 05:14:44,028 INFO L158 Benchmark]: TraceAbstraction took 5927.77ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 112.5MB in the beginning and 142.8MB in the end (delta: -30.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-10-24 05:14:44,028 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 226.5MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:14:44,029 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.17ms. Allocated memory is still 104.9MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.60ms. Allocated memory is still 182.5MB. Free memory was 115.2MB in the beginning and 154.1MB in the end (delta: -38.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.14ms. Allocated memory is still 182.5MB. Free memory was 154.1MB in the beginning and 149.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.75ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 141.9MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 607.40ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 113.2MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5927.77ms. Allocated memory was 182.5MB in the beginning and 226.5MB in the end (delta: 44.0MB). Free memory was 112.5MB in the beginning and 142.8MB in the end (delta: -30.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 226.5MB. Free memory was 142.8MB in the beginning and 141.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of shiftLeft at line 136, overapproximation of someBinaryArithmeticDOUBLEoperation at line 59. 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; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L131] last_1_var_1_8 = var_1_8 [L132] last_1_var_1_19 = var_1_19 [L133] last_1_var_1_27 = var_1_27 [L143] RET updateLastVariables() [L144] CALL updateVariables() [L87] var_1_3 = __VERIFIER_nondet_char() [L88] 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=17, 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=17, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L88] 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=17, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L89] 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=17, 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=17, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L89] 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=17, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L90] 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=17, 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=17, 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 != 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=17, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L93] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L93] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L94] var_1_7 = __VERIFIER_nondet_uchar() [L95] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L95] 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=17, var_1_6=-255, var_1_8=50, var_1_9=327/10] [L96] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L96] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L97] var_1_10 = __VERIFIER_nondet_double() [L98] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L98] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L99] var_1_11 = __VERIFIER_nondet_double() [L100] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L100] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L102] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L104] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L105] var_1_14 = __VERIFIER_nondet_double() [L106] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L106] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L107] var_1_16 = __VERIFIER_nondet_ushort() [L108] 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=17, var_1_6=-255, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L108] 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L109] 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=0, 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=17, var_1_6=-255, 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=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L109] 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=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L110] var_1_17 = __VERIFIER_nondet_ushort() [L111] 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=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=17, var_1_6=-255, 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=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L111] 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=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L112] 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=0, var_1_17=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=17, var_1_6=-255, 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=0, var_1_17=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L112] 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=0, var_1_17=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L113] var_1_18 = __VERIFIER_nondet_ushort() [L114] 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=0, var_1_17=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=17, var_1_6=-255, 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=0, var_1_17=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L114] 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=0, var_1_17=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L115] 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=0, var_1_17=65536, var_1_18=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=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L115] 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=0, var_1_17=65536, var_1_18=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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L116] var_1_20 = __VERIFIER_nondet_short() [L117] 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=0, var_1_17=65536, var_1_18=0, 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=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L117] 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=0, var_1_17=65536, var_1_18=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L118] 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=0, var_1_17=65536, var_1_18=0, 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=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L118] 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=0, var_1_17=65536, var_1_18=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L119] var_1_21 = __VERIFIER_nondet_short() [L120] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L120] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L121] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L121] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L123] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L124] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L124] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, 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=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L125] var_1_24 = __VERIFIER_nondet_ushort() [L126] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L126] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L127] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L127] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L144] RET updateVariables() [L145] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L52] COND TRUE (-1 << last_1_var_1_19) < var_1_3 [L53] COND FALSE !((last_1_var_1_19 / var_1_3) > (-1000000000 + last_1_var_1_19)) [L56] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50, var_1_9=327/10] [L59] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] [L60] COND TRUE var_1_10 >= var_1_11 [L61] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] [L63] var_1_25 = -256 [L64] var_1_26 = var_1_17 [L65] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=-256, var_1_26=65536, var_1_27=-255, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] [L66] COND FALSE !(var_1_7 || var_1_1) [L77] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=-4, var_1_24=2, var_1_25=-256, var_1_26=65536, var_1_27=-255, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] [L79] COND TRUE var_1_6 || (var_1_16 <= (var_1_22 / var_1_24)) [L80] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=2, var_1_25=-256, var_1_26=65536, var_1_27=-255, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] [L82] COND FALSE !((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23) 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=2, var_1_25=-256, var_1_26=65536, var_1_27=-255, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] [L145] RET step() [L146] CALL, EXPR property() [L136] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=2, var_1_25=-256, var_1_26=65536, var_1_27=-255, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] [L136-L137] 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)) ; [L146] RET, EXPR property() [L146] 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=2, var_1_25=-256, var_1_26=65536, var_1_27=-255, var_1_3=17, var_1_6=-255, 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=0, var_1_17=65536, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=2, var_1_25=-256, var_1_26=65536, var_1_27=-255, var_1_3=17, var_1_6=-255, var_1_7=0, var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 913 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 529 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 389 IncrementalHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 384 mSDtfsCounter, 389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 583 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 335 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 994 ConstructedInterpolants, 0 QuantifiedInterpolants, 2303 SizeOfPredicates, 2 NumberOfNonLiveVariables, 382 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-10-24 05:14:44,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_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 7e259d0d348361eebf16bf1e72a5d71337e9d01f69230834d61aaa75aa741f6d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:14:46,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:14:46,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:14:46,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:14:46,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:14:46,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:14:46,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:14:46,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:14:46,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:14:46,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:14:46,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:14:46,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:14:46,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:14:46,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:14:46,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:14:46,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:14:46,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:14:46,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:14:46,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:14:46,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:14:46,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:14:46,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:14:46,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:14:46,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:14:46,607 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:14:46,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:14:46,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:14:46,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:14:46,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:14:46,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:14:46,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:14:46,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:14:46,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:14:46,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:14:46,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:14:46,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:14:46,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:14:46,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:14:46,613 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:14:46,614 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:14:46,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:14:46,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:14:46,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:14:46,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:14:46,616 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:14:46,616 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 -> 7e259d0d348361eebf16bf1e72a5d71337e9d01f69230834d61aaa75aa741f6d [2024-10-24 05:14:46,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:14:46,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:14:46,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:14:46,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:14:46,980 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:14:46,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i [2024-10-24 05:14:48,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:14:48,839 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:14:48,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i [2024-10-24 05:14:48,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef91286f0/aa13576b545c4026b656741da2c828b9/FLAGd0c294085 [2024-10-24 05:14:49,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef91286f0/aa13576b545c4026b656741da2c828b9 [2024-10-24 05:14:49,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:14:49,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:14:49,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:49,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:14:49,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:14:49,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d1bfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49, skipping insertion in model container [2024-10-24 05:14:49,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:14:49,424 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i[919,932] [2024-10-24 05:14:49,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:49,533 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:14:49,545 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-94.i[919,932] [2024-10-24 05:14:49,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:49,613 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:14:49,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49 WrapperNode [2024-10-24 05:14:49,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:49,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:49,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:14:49,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:14:49,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,669 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-10-24 05:14:49,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:49,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:14:49,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:14:49,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:14:49,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,735 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:14:49,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:14:49,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:14:49,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:14:49,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:14:49,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (1/1) ... [2024-10-24 05:14:49,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:14:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:49,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:14:49,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:14:49,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:14:49,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:14:49,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:14:49,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:14:49,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:14:49,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:14:49,940 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:14:49,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:14:54,766 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:14:54,766 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:14:54,829 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:14:54,829 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:14:54,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:54 BoogieIcfgContainer [2024-10-24 05:14:54,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:14:54,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:14:54,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:14:54,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:14:54,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:14:49" (1/3) ... [2024-10-24 05:14:54,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52967bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:54, skipping insertion in model container [2024-10-24 05:14:54,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:49" (2/3) ... [2024-10-24 05:14:54,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52967bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:54, skipping insertion in model container [2024-10-24 05:14:54,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:54" (3/3) ... [2024-10-24 05:14:54,842 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-94.i [2024-10-24 05:14:54,868 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:14:54,869 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:14:54,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:14:54,951 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;@25360278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:14:54,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:14:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 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-10-24 05:14:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 05:14:54,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:54,976 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] [2024-10-24 05:14:54,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash -610671267, now seen corresponding path program 1 times [2024-10-24 05:14:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:14:54,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707269310] [2024-10-24 05:14:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:54,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:14:55,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:14:55,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:14:55,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:14:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:55,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:14:55,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:14:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-24 05:14:55,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:14:55,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:14:55,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707269310] [2024-10-24 05:14:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707269310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:55,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:55,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:14:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299911655] [2024-10-24 05:14:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:55,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:14:55,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:14:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:14:55,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:14:55,503 INFO L87 Difference]: Start difference. First operand has 65 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10-24 05:14:57,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:14:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:57,554 INFO L93 Difference]: Finished difference Result 127 states and 229 transitions. [2024-10-24 05:14:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:14:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 162 [2024-10-24 05:14:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:57,593 INFO L225 Difference]: With dead ends: 127 [2024-10-24 05:14:57,593 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 05:14:57,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:14:57,599 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:57,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 05:14:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 05:14:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 05:14:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 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-10-24 05:14:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-24 05:14:57,655 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 162 [2024-10-24 05:14:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:57,657 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-24 05:14:57,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10-24 05:14:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-24 05:14:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 05:14:57,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:57,664 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] [2024-10-24 05:14:57,680 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-10-24 05:14:57,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:14:57,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:57,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1299842447, now seen corresponding path program 1 times [2024-10-24 05:14:57,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:14:57,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861561428] [2024-10-24 05:14:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:57,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:14:57,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:14:57,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:14:57,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:14:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:58,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 05:14:58,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:14:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-24 05:14:59,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:14:59,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:14:59,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861561428] [2024-10-24 05:14:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861561428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:59,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:14:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665404479] [2024-10-24 05:14:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:59,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:14:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:14:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:14:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:14:59,843 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (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-10-24 05:15:02,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:15:05,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:15:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:15:05,766 INFO L93 Difference]: Finished difference Result 193 states and 295 transitions. [2024-10-24 05:15:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:15:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (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 162 [2024-10-24 05:15:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:15:05,799 INFO L225 Difference]: With dead ends: 193 [2024-10-24 05:15:05,800 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 05:15:05,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:15:05,802 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-24 05:15:05,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 278 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-24 05:15:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 05:15:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2024-10-24 05:15:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 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-10-24 05:15:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 191 transitions. [2024-10-24 05:15:05,848 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 191 transitions. Word has length 162 [2024-10-24 05:15:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:15:05,849 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 191 transitions. [2024-10-24 05:15:05,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (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-10-24 05:15:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 191 transitions. [2024-10-24 05:15:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 05:15:05,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:15:05,852 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] [2024-10-24 05:15:05,872 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-10-24 05:15:06,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:15:06,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:15:06,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:15:06,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1519960067, now seen corresponding path program 1 times [2024-10-24 05:15:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:15:06,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611723035] [2024-10-24 05:15:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:15:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:15:06,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:15:06,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:15:06,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:15:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:06,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:15:06,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:15:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-24 05:15:07,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:15:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-24 05:15:08,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:15:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611723035] [2024-10-24 05:15:08,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611723035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:15:08,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:15:08,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 05:15:08,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103805419] [2024-10-24 05:15:08,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:15:08,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:15:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:15:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:15:08,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:15:08,703 INFO L87 Difference]: Start difference. First operand 123 states and 191 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-10-24 05:15:13,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:15:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:15:14,851 INFO L93 Difference]: Finished difference Result 519 states and 781 transitions. [2024-10-24 05:15:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 05:15:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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 163 [2024-10-24 05:15:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:15:14,858 INFO L225 Difference]: With dead ends: 519 [2024-10-24 05:15:14,858 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 05:15:14,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2024-10-24 05:15:14,861 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 221 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:15:14,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 217 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-24 05:15:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 05:15:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 202. [2024-10-24 05:15:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 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-10-24 05:15:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2024-10-24 05:15:14,945 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 163 [2024-10-24 05:15:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:15:14,946 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2024-10-24 05:15:14,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-10-24 05:15:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2024-10-24 05:15:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 05:15:14,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:15:14,949 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] [2024-10-24 05:15:14,969 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 05:15:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:15:15,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:15:15,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:15:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1126933057, now seen corresponding path program 1 times [2024-10-24 05:15:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:15:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841763793] [2024-10-24 05:15:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:15:15,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:15:15,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:15:15,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:15:15,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 05:15:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:15:16,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 05:15:16,367 INFO L278 TraceCheckSpWp]: Computing forward predicates...