./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.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 ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:01:01,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:01:01,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:01:01,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:01:01,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:01:01,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:01:01,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:01:01,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:01:01,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:01:01,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:01:01,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:01:01,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:01:01,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:01:01,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:01:01,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:01:01,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:01:01,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:01:01,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:01:01,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:01:01,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:01:01,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:01:01,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:01:01,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:01:01,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:01:01,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:01:01,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:01:01,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:01:01,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:01:01,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:01:01,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:01:01,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:01:01,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:01:01,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:01,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:01:01,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:01:01,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:01:01,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:01:01,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:01:01,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:01:01,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:01:01,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:01:01,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:01:01,834 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 -> ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 [2024-11-16 18:01:02,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:01:02,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:01:02,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:01:02,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:01:02,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:01:02,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2024-11-16 18:01:03,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:01:03,749 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:01:03,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2024-11-16 18:01:03,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f484e6f/9ece0d48311440bfbb06e425e379408b/FLAG406762830 [2024-11-16 18:01:03,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f484e6f/9ece0d48311440bfbb06e425e379408b [2024-11-16 18:01:03,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:01:03,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:01:03,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:03,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:01:03,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:01:03,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:03" (1/1) ... [2024-11-16 18:01:03,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58842360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:03, skipping insertion in model container [2024-11-16 18:01:03,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:03" (1/1) ... [2024-11-16 18:01:03,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:01:04,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i[913,926] [2024-11-16 18:01:04,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:04,098 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:01:04,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i[913,926] [2024-11-16 18:01:04,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:04,166 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:01:04,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04 WrapperNode [2024-11-16 18:01:04,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:04,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:04,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:01:04,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:01:04,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,226 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-16 18:01:04,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:04,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:01:04,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:01:04,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:01:04,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:01:04,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:01:04,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:01:04,285 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:01:04,285 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:01:04,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (1/1) ... [2024-11-16 18:01:04,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:04,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:01:04,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:01:04,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:01:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:01:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:01:04,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:01:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:01:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:01:04,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:01:04,533 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:01:04,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:01:04,776 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 18:01:04,777 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:01:04,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:01:04,793 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:01:04,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:04 BoogieIcfgContainer [2024-11-16 18:01:04,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:01:04,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:01:04,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:01:04,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:01:04,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:01:03" (1/3) ... [2024-11-16 18:01:04,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df4e0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:04, skipping insertion in model container [2024-11-16 18:01:04,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:04" (2/3) ... [2024-11-16 18:01:04,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df4e0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:04, skipping insertion in model container [2024-11-16 18:01:04,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:04" (3/3) ... [2024-11-16 18:01:04,803 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-38.i [2024-11-16 18:01:04,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:01:04,816 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:01:04,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:01:04,877 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;@66d65c69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:01:04,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:01:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:01:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:01:04,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:04,900 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:04,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:04,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash 934270125, now seen corresponding path program 1 times [2024-11-16 18:01:04,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:01:04,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144475639] [2024-11-16 18:01:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:01:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:01:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:01:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:01:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:01:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:01:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:01:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:01:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 18:01:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 18:01:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 18:01:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 18:01:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 18:01:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 18:01:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 18:01:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 18:01:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:01:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:01:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 18:01:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 18:01:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 18:01:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 18:01:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 18:01:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 18:01:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 18:01:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 18:01:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:01:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144475639] [2024-11-16 18:01:05,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144475639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:05,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:01:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442651363] [2024-11-16 18:01:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:05,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:01:05,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:01:05,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:01:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:05,415 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 18:01:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:05,441 INFO L93 Difference]: Finished difference Result 124 states and 209 transitions. [2024-11-16 18:01:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:01:05,443 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-11-16 18:01:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:05,449 INFO L225 Difference]: With dead ends: 124 [2024-11-16 18:01:05,449 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 18:01:05,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:05,457 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:05,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:01:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 18:01:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-16 18:01:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:01:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-16 18:01:05,515 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 150 [2024-11-16 18:01:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:05,516 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-16 18:01:05,516 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 18:01:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-16 18:01:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:01:05,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:05,522 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:05,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:01:05,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:05,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash -21099351, now seen corresponding path program 1 times [2024-11-16 18:01:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:01:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135689166] [2024-11-16 18:01:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:01:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:01:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:01:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:01:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:01:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:01:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:01:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:01:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 18:01:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 18:01:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 18:01:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 18:01:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 18:01:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 18:01:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 18:01:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 18:01:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:01:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:01:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 18:01:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 18:01:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 18:01:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 18:01:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 18:01:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 18:01:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 18:01:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 18:01:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:01:05,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135689166] [2024-11-16 18:01:05,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135689166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:01:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611475004] [2024-11-16 18:01:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:05,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:01:05,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:01:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:01:05,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:01:05,875 INFO L87 Difference]: Start difference. First operand 61 states and 88 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 18:01:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:05,928 INFO L93 Difference]: Finished difference Result 155 states and 221 transitions. [2024-11-16 18:01:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:01:05,929 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-16 18:01:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:05,933 INFO L225 Difference]: With dead ends: 155 [2024-11-16 18:01:05,935 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 18:01:05,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:01:05,937 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:05,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 162 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:01:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 18:01:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-11-16 18:01:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:01:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-11-16 18:01:05,962 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 150 [2024-11-16 18:01:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:05,964 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-11-16 18:01:05,965 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 18:01:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-11-16 18:01:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:01:05,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:05,969 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:05,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:01:05,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:05,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash 7529800, now seen corresponding path program 1 times [2024-11-16 18:01:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:01:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762915399] [2024-11-16 18:01:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:01:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:01:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:01:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:01:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:01:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:01:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:01:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:01:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 18:01:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 18:01:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 18:01:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 18:01:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 18:01:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 18:01:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 18:01:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 18:01:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:01:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:01:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 18:01:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 18:01:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 18:01:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 18:01:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 18:01:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 18:01:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 18:01:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-16 18:01:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:01:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762915399] [2024-11-16 18:01:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762915399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:01:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632855181] [2024-11-16 18:01:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:06,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:01:06,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:01:06,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:01:06,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:01:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:07,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 18:01:07,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:01:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 297 proven. 180 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2024-11-16 18:01:08,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:01:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-16 18:01:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632855181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:01:08,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 18:01:08,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 19 [2024-11-16 18:01:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146299532] [2024-11-16 18:01:08,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 18:01:08,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:01:08,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:01:08,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:01:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:01:08,753 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 5 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (49), 4 states have call predecessors, (49), 5 states have call successors, (49) [2024-11-16 18:01:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:09,310 INFO L93 Difference]: Finished difference Result 213 states and 285 transitions. [2024-11-16 18:01:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 18:01:09,311 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 5 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (49), 4 states have call predecessors, (49), 5 states have call successors, (49) Word has length 150 [2024-11-16 18:01:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:09,318 INFO L225 Difference]: With dead ends: 213 [2024-11-16 18:01:09,318 INFO L226 Difference]: Without dead ends: 123 [2024-11-16 18:01:09,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2024-11-16 18:01:09,320 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:09,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 320 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:01:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-16 18:01:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2024-11-16 18:01:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 73 states have internal predecessors, (77), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:01:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2024-11-16 18:01:09,348 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 150 [2024-11-16 18:01:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:09,349 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2024-11-16 18:01:09,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 5 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (49), 4 states have call predecessors, (49), 5 states have call successors, (49) [2024-11-16 18:01:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2024-11-16 18:01:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:01:09,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:09,352 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:09,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 18:01:09,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:01:09,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:09,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -188983705, now seen corresponding path program 1 times [2024-11-16 18:01:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:01:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539493346] [2024-11-16 18:01:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:01:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:01:09,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:01:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:01:09,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:01:09,732 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:01:09,733 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:01:09,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:01:09,738 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 18:01:09,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:01:09,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:01:09 BoogieIcfgContainer [2024-11-16 18:01:09,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:01:09,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:01:09,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:01:09,839 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:01:09,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:04" (3/4) ... [2024-11-16 18:01:09,841 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:01:09,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:01:09,844 INFO L158 Benchmark]: Toolchain (without parser) took 6058.77ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 102.3MB in the beginning and 65.5MB in the end (delta: 36.8MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2024-11-16 18:01:09,844 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:01:09,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.17ms. Allocated memory is still 169.9MB. Free memory was 102.1MB in the beginning and 87.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 18:01:09,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.81ms. Allocated memory is still 169.9MB. Free memory was 87.2MB in the beginning and 84.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:01:09,846 INFO L158 Benchmark]: Boogie Preprocessor took 55.74ms. Allocated memory is still 169.9MB. Free memory was 84.1MB in the beginning and 79.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:01:09,846 INFO L158 Benchmark]: IcfgBuilder took 508.88ms. Allocated memory is still 169.9MB. Free memory was 79.5MB in the beginning and 125.9MB in the end (delta: -46.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 18:01:09,846 INFO L158 Benchmark]: TraceAbstraction took 5041.33ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 125.2MB in the beginning and 65.5MB in the end (delta: 59.7MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2024-11-16 18:01:09,847 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 220.2MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:01:09,850 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 113.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.17ms. Allocated memory is still 169.9MB. Free memory was 102.1MB in the beginning and 87.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.81ms. Allocated memory is still 169.9MB. Free memory was 87.2MB in the beginning and 84.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.74ms. Allocated memory is still 169.9MB. Free memory was 84.1MB in the beginning and 79.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 508.88ms. Allocated memory is still 169.9MB. Free memory was 79.5MB in the beginning and 125.9MB in the end (delta: -46.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5041.33ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 125.2MB in the beginning and 65.5MB in the end (delta: 59.7MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 220.2MB. Free memory is still 65.5MB. 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 107, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; [L38] unsigned short int var_1_17 = 25; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_ushort() [L66] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] var_1_3 = __VERIFIER_nondet_ushort() [L69] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L74] var_1_6 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L75] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L78] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L80] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L82] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L84] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L88] var_1_14 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L95] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L97] var_1_18 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L98] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L100] var_1_19 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L101] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L115] RET updateVariables() [L116] CALL step() [L44] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L45] unsigned short int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-2, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L46] COND FALSE !(var_1_4 > stepLocal_0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L49] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647] [L50] COND TRUE ! var_1_13 [L51] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=65074, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647] [L59] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, stepLocal_1=-255, var_1_12=65074, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647] [L60] COND FALSE !((var_1_13 && var_1_18) && stepLocal_1) VAL [isInitial=1, var_1_12=65074, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3))))) && (((var_1_13 && var_1_18) && var_1_19) ? (var_1_17 == ((unsigned short int) (var_1_15 + var_1_14))) : 1) ; VAL [\result=0, isInitial=1, var_1_12=65074, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=65074, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647] [L19] reach_error() VAL [isInitial=1, var_1_12=65074, var_1_13=0, var_1_14=82379, var_1_15=-49153, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-5398593538, var_1_4=0, var_1_5=16, var_1_6=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 487 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 237 mSDtfsCounter, 487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 458 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 3114 SizeOfPredicates, 3 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5097/5520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:01:09,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.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 ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:01:12,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:01:12,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:01:12,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:01:12,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:01:12,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:01:12,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:01:12,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:01:12,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:01:12,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:01:12,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:01:12,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:01:12,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:01:12,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:01:12,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:01:12,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:01:12,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:01:12,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:01:12,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:01:12,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:01:12,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:01:12,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:01:12,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:01:12,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:01:12,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:01:12,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:01:12,166 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:01:12,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:01:12,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:01:12,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:01:12,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:01:12,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:01:12,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:01:12,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:01:12,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:12,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:01:12,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:01:12,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:01:12,169 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:01:12,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:01:12,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:01:12,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:01:12,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:01:12,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:01:12,171 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 -> ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 [2024-11-16 18:01:12,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:01:12,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:01:12,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:01:12,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:01:12,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:01:12,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2024-11-16 18:01:13,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:01:14,151 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:01:14,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2024-11-16 18:01:14,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3064c4275/11c96f09cbe04c6fa3075abe570605f1/FLAGed70b3406 [2024-11-16 18:01:14,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3064c4275/11c96f09cbe04c6fa3075abe570605f1 [2024-11-16 18:01:14,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:01:14,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:01:14,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:14,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:01:14,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:01:14,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6fa202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14, skipping insertion in model container [2024-11-16 18:01:14,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:01:14,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i[913,926] [2024-11-16 18:01:14,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:14,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:01:14,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i[913,926] [2024-11-16 18:01:14,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:01:14,530 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:01:14,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14 WrapperNode [2024-11-16 18:01:14,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:01:14,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:14,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:01:14,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:01:14,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,577 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-16 18:01:14,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:01:14,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:01:14,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:01:14,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:01:14,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,602 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:01:14,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:01:14,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:01:14,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:01:14,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:01:14,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (1/1) ... [2024-11-16 18:01:14,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:01:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:01:14,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:01:14,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:01:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:01:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:01:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:01:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:01:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:01:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:01:14,805 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:01:14,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:01:18,984 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 18:01:18,984 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:01:18,996 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:01:18,996 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:01:18,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:18 BoogieIcfgContainer [2024-11-16 18:01:18,997 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:01:18,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:01:18,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:01:19,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:01:19,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:01:14" (1/3) ... [2024-11-16 18:01:19,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1cfe1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:19, skipping insertion in model container [2024-11-16 18:01:19,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:01:14" (2/3) ... [2024-11-16 18:01:19,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1cfe1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:01:19, skipping insertion in model container [2024-11-16 18:01:19,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:01:18" (3/3) ... [2024-11-16 18:01:19,004 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-38.i [2024-11-16 18:01:19,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:01:19,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:01:19,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:01:19,069 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;@2ed9b940, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:01:19,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:01:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:01:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:01:19,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:19,089 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:19,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:19,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash 934270125, now seen corresponding path program 1 times [2024-11-16 18:01:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:01:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895515825] [2024-11-16 18:01:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:19,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:19,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:01:19,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:01:19,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:01:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:19,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:01:19,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:01:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-16 18:01:19,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:01:19,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:01:19,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895515825] [2024-11-16 18:01:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895515825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:19,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:01:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424884586] [2024-11-16 18:01:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:19,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:01:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:01:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:01:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:19,575 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 18:01:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:19,598 INFO L93 Difference]: Finished difference Result 124 states and 209 transitions. [2024-11-16 18:01:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:01:19,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-11-16 18:01:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:19,610 INFO L225 Difference]: With dead ends: 124 [2024-11-16 18:01:19,610 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 18:01:19,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:01:19,620 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:19,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:01:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 18:01:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-16 18:01:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:01:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-16 18:01:19,672 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 150 [2024-11-16 18:01:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:19,672 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-16 18:01:19,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 18:01:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-16 18:01:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:01:19,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:19,676 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:19,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:01:19,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:19,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:19,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:19,878 INFO L85 PathProgramCache]: Analyzing trace with hash -21099351, now seen corresponding path program 1 times [2024-11-16 18:01:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:01:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592480551] [2024-11-16 18:01:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:19,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:01:19,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:01:19,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:01:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:20,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 18:01:20,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:01:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 18:01:20,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:01:20,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:01:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592480551] [2024-11-16 18:01:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592480551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:01:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:01:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:01:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996576844] [2024-11-16 18:01:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:01:20,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:01:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:01:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:01:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:01:20,267 INFO L87 Difference]: Start difference. First operand 61 states and 88 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 18:01:22,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 18:01:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:01:22,484 INFO L93 Difference]: Finished difference Result 155 states and 221 transitions. [2024-11-16 18:01:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:01:22,521 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-16 18:01:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:01:22,524 INFO L225 Difference]: With dead ends: 155 [2024-11-16 18:01:22,524 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 18:01:22,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:01:22,529 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:01:22,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 18:01:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 18:01:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-11-16 18:01:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:01:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-11-16 18:01:22,558 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 150 [2024-11-16 18:01:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:01:22,559 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-11-16 18:01:22,559 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 18:01:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-11-16 18:01:22,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 18:01:22,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:01:22,562 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:01:22,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 18:01:22,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:22,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:01:22,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:01:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash 7529800, now seen corresponding path program 1 times [2024-11-16 18:01:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:01:22,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222074350] [2024-11-16 18:01:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:01:22,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:01:22,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:01:22,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:01:22,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:01:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:01:23,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-16 18:01:23,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:01:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 339 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-16 18:01:54,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:02:26,988 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)