./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_loopvsstraightlinecode_50-while_file-12.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 41218f936bf95b34a4ca651f02a06980e6dee4f66c0a1bb8aa6f08c1f62da5e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:53:41,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:53:41,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:53:41,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:53:41,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:53:41,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:53:41,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:53:41,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:53:41,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:53:41,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:53:41,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:53:41,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:53:41,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:53:41,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:53:41,678 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:53:41,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:53:41,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:53:41,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:53:41,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:53:41,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:53:41,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:53:41,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:53:41,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:53:41,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:53:41,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:53:41,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:53:41,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:53:41,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:53:41,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:53:41,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:53:41,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:53:41,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:53:41,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:53:41,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:53:41,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:53:41,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:53:41,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:53:41,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:53:41,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:53:41,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:53:41,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:53:41,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:53:41,688 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 -> 41218f936bf95b34a4ca651f02a06980e6dee4f66c0a1bb8aa6f08c1f62da5e8 [2024-11-10 07:53:41,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:53:41,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:53:41,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:53:41,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:53:41,996 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:53:41,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-12.i [2024-11-10 07:53:43,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:53:43,810 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:53:43,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-12.i [2024-11-10 07:53:43,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1661268af/b2859fba61c34e4489fe43f0dfd828f7/FLAG0e3ba182c [2024-11-10 07:53:43,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1661268af/b2859fba61c34e4489fe43f0dfd828f7 [2024-11-10 07:53:43,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:53:43,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:53:43,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:53:43,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:53:43,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:53:43,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:53:43" (1/1) ... [2024-11-10 07:53:43,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577f443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:43, skipping insertion in model container [2024-11-10 07:53:43,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:53:43" (1/1) ... [2024-11-10 07:53:43,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:53:44,053 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_loopvsstraightlinecode_50-while_file-12.i[915,928] [2024-11-10 07:53:44,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:53:44,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:53:44,144 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_loopvsstraightlinecode_50-while_file-12.i[915,928] [2024-11-10 07:53:44,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:53:44,201 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:53:44,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44 WrapperNode [2024-11-10 07:53:44,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:53:44,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:53:44,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:53:44,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:53:44,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,264 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-10 07:53:44,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:53:44,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:53:44,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:53:44,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:53:44,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,326 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-10 07:53:44,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:53:44,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:53:44,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:53:44,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:53:44,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (1/1) ... [2024-11-10 07:53:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:53:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:53:44,404 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-10 07:53:44,426 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-10 07:53:44,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:53:44,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:53:44,470 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:53:44,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:53:44,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:53:44,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:53:44,549 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:53:44,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:53:44,959 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 07:53:44,963 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:53:44,980 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:53:44,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:53:44,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:53:44 BoogieIcfgContainer [2024-11-10 07:53:44,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:53:44,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:53:44,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:53:44,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:53:44,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:53:43" (1/3) ... [2024-11-10 07:53:44,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53772d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:53:44, skipping insertion in model container [2024-11-10 07:53:44,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:44" (2/3) ... [2024-11-10 07:53:44,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53772d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:53:44, skipping insertion in model container [2024-11-10 07:53:44,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:53:44" (3/3) ... [2024-11-10 07:53:44,997 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-12.i [2024-11-10 07:53:45,016 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:53:45,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:53:45,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:53:45,095 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;@4b70fe14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:53:45,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:53:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:53:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:53:45,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:53:45,120 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:53:45,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:53:45,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:53:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1163729006, now seen corresponding path program 1 times [2024-11-10 07:53:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:53:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81324389] [2024-11-10 07:53:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:53:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:53:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:53:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:53:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:53:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:53:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:53:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:53:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:53:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:53:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:53:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:53:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:53:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:53:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:53:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:53:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:53:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:53:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:53:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:53:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:53:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:53:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:53:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:53:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:53:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:53:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:53:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81324389] [2024-11-10 07:53:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81324389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:53:45,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:53:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:53:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280831878] [2024-11-10 07:53:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:53:45,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:53:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:53:45,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:53:45,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:53:45,736 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:53:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:53:45,772 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2024-11-10 07:53:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:53:45,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-11-10 07:53:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:53:45,783 INFO L225 Difference]: With dead ends: 130 [2024-11-10 07:53:45,783 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 07:53:45,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-10 07:53:45,790 INFO L432 NwaCegarLoop]: 95 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, 95 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-10 07:53:45,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:53:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 07:53:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 07:53:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:53:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 07:53:45,849 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 147 [2024-11-10 07:53:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:53:45,850 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 07:53:45,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:53:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 07:53:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:53:45,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:53:45,858 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:53:45,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:53:45,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:53:45,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:53:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 944211919, now seen corresponding path program 1 times [2024-11-10 07:53:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:53:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30330018] [2024-11-10 07:53:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:53:45,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:53:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:53:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:53:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:53:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:53:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:53:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:53:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:53:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:53:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:53:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:53:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:53:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:53:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:53:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:53:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:53:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:53:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:53:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:53:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:53:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:53:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:53:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:53:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:53:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:53:47,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:53:47,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30330018] [2024-11-10 07:53:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30330018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:53:47,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:53:47,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:53:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824090951] [2024-11-10 07:53:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:53:47,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:53:47,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:53:47,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:53:47,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:53:47,116 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:53:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:53:47,508 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2024-11-10 07:53:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:53:47,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-11-10 07:53:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:53:47,513 INFO L225 Difference]: With dead ends: 188 [2024-11-10 07:53:47,514 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 07:53:47,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:53:47,517 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 53 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:53:47,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 296 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:53:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 07:53:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2024-11-10 07:53:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 07:53:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2024-11-10 07:53:47,555 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 147 [2024-11-10 07:53:47,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:53:47,556 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2024-11-10 07:53:47,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:53:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2024-11-10 07:53:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:53:47,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:53:47,562 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:53:47,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:53:47,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:53:47,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:53:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash 756971732, now seen corresponding path program 1 times [2024-11-10 07:53:47,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:53:47,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071444292] [2024-11-10 07:53:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:53:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:53:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:53:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:53:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:53:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:53:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:53:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:53:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:53:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:53:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:53:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:53:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:53:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:53:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:53:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:53:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:53:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:53:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:53:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:53:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:53:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:53:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:53:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:53:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:53:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:53:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:53:48,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071444292] [2024-11-10 07:53:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071444292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:53:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399351542] [2024-11-10 07:53:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:53:48,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:53:48,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:53:48,234 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-10 07:53:48,236 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-10 07:53:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:53:48,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 07:53:48,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:53:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-10 07:53:48,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:53:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:53:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399351542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:53:49,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:53:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2024-11-10 07:53:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834955226] [2024-11-10 07:53:49,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:53:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 07:53:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:53:49,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 07:53:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:53:49,252 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-10 07:53:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:53:50,111 INFO L93 Difference]: Finished difference Result 296 states and 434 transitions. [2024-11-10 07:53:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 07:53:50,112 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 148 [2024-11-10 07:53:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:53:50,118 INFO L225 Difference]: With dead ends: 296 [2024-11-10 07:53:50,118 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 07:53:50,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=1069, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 07:53:50,122 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 442 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:53:50,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 542 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:53:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 07:53:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 196. [2024-11-10 07:53:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 07:53:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2024-11-10 07:53:50,188 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 148 [2024-11-10 07:53:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:53:50,191 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2024-11-10 07:53:50,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 19 states have internal predecessors, (85), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-10 07:53:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2024-11-10 07:53:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:53:50,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:53:50,194 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:53:50,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:53:50,394 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-10 07:53:50,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:53:50,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:53:50,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1050374739, now seen corresponding path program 1 times [2024-11-10 07:53:50,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:53:50,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074750543] [2024-11-10 07:53:50,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:53:50,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:53:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:53:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812810368] [2024-11-10 07:53:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:53:50,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:53:50,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:53:50,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:53:50,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:53:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:53:51,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:53:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:53:51,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:53:51,255 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:53:51,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:53:51,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:53:51,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 07:53:51,462 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 07:53:51,571 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:53:51,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:53:51 BoogieIcfgContainer [2024-11-10 07:53:51,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:53:51,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:53:51,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:53:51,576 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:53:51,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:53:44" (3/4) ... [2024-11-10 07:53:51,580 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:53:51,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:53:51,583 INFO L158 Benchmark]: Toolchain (without parser) took 7740.25ms. Allocated memory was 151.0MB in the beginning and 260.0MB in the end (delta: 109.1MB). Free memory was 95.7MB in the beginning and 174.6MB in the end (delta: -78.9MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-10 07:53:51,584 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory was 84.0MB in the beginning and 83.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:53:51,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.11ms. Allocated memory is still 151.0MB. Free memory was 95.7MB in the beginning and 79.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:53:51,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.64ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 75.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:53:51,585 INFO L158 Benchmark]: Boogie Preprocessor took 83.80ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 75.9MB in the beginning and 184.1MB in the end (delta: -108.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-10 07:53:51,587 INFO L158 Benchmark]: IcfgBuilder took 633.28ms. Allocated memory is still 216.0MB. Free memory was 184.0MB in the beginning and 164.7MB in the end (delta: 19.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-11-10 07:53:51,587 INFO L158 Benchmark]: TraceAbstraction took 6586.88ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 164.7MB in the beginning and 174.6MB in the end (delta: -9.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-11-10 07:53:51,588 INFO L158 Benchmark]: Witness Printer took 5.47ms. Allocated memory is still 260.0MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:53:51,589 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.20ms. Allocated memory is still 151.0MB. Free memory was 84.0MB in the beginning and 83.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.11ms. Allocated memory is still 151.0MB. Free memory was 95.7MB in the beginning and 79.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.64ms. Allocated memory is still 151.0MB. Free memory was 79.6MB in the beginning and 75.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.80ms. Allocated memory was 151.0MB in the beginning and 216.0MB in the end (delta: 65.0MB). Free memory was 75.9MB in the beginning and 184.1MB in the end (delta: -108.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * IcfgBuilder took 633.28ms. Allocated memory is still 216.0MB. Free memory was 184.0MB in the beginning and 164.7MB in the end (delta: 19.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6586.88ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 164.7MB in the beginning and 174.6MB in the end (delta: -9.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Witness Printer took 5.47ms. Allocated memory is still 260.0MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_5 = 128; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 128; [L27] signed long int var_1_9 = 1967984875; [L28] float var_1_10 = 256.625; [L29] float var_1_11 = 24.5; [L30] float var_1_12 = 999999.25; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 0; [L33] double var_1_15 = 127.3; [L34] float var_1_16 = 15.8; [L35] double var_1_17 = -0.4; [L36] unsigned long int var_1_18 = 8; [L37] unsigned long int var_1_19 = 2366774301; [L38] unsigned char var_1_20 = 0; [L39] signed short int var_1_21 = 5; [L40] signed char var_1_22 = 0; [L41] signed char var_1_23 = 2; [L42] unsigned char last_1_var_1_1 = 5; [L43] unsigned long int last_1_var_1_18 = 8; [L44] signed char last_1_var_1_22 = 0; VAL [isInitial=0, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=128, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_18 = var_1_18 [L129] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=128, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L139] RET updateLastVariables() [L140] CALL updateVariables() [L89] var_1_5 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L90] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L91] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=10, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L94] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=0, var_1_8=128, var_1_9=1967984875] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_8=128, var_1_9=1967984875] [L97] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1967984875] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1967984875] [L97] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1967984875] [L98] var_1_9 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_9 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L99] RET assume_abort_if_not(var_1_9 >= 1073741822) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L100] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L100] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_11=49/2, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L101] var_1_11 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L102] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_12=3999997/4, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L103] var_1_12 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L104] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=1, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L105] var_1_13 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L106] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L107] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L107] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L108] var_1_14 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L109] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L110] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L110] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_16=79/5, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L111] var_1_16 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L112] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L113] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L113] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L114] var_1_17 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L115] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=2366774301, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L116] var_1_19 = __VERIFIER_nondet_ulong() [L117] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L117] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L118] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L118] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=0, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L119] var_1_20 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L121] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L121] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=2, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L122] var_1_23 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_23 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L123] RET assume_abort_if_not(var_1_23 >= -63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L124] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L124] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L140] RET updateVariables() [L141] CALL step() [L48] unsigned char stepLocal_2 = var_1_9 >= last_1_var_1_22; [L49] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_1=5, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L50] COND FALSE !(stepLocal_1 > last_1_var_1_18) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_2=1, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=8, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L53] COND TRUE var_1_20 || stepLocal_2 [L54] var_1_18 = var_1_6 VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=5, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L59] COND TRUE last_1_var_1_1 > (var_1_18 * var_1_18) [L60] var_1_1 = (var_1_5 - (var_1_6 + var_1_7)) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=5, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L64] var_1_21 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) [L65] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_0=-254, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=128, var_1_9=1073741822] [L66] COND TRUE (- var_1_18) > stepLocal_0 [L67] var_1_8 = ((var_1_9 - var_1_21) - var_1_5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L69] signed long int stepLocal_3 = var_1_8; VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, stepLocal_3=1073741505, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L70] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2053/8, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L77] COND TRUE var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))) [L78] var_1_10 = ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1273/10, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L84] COND TRUE (var_1_12 / var_1_16) >= var_1_10 [L85] var_1_15 = (var_1_17 + 255.5) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return (((((((last_1_var_1_1 > (var_1_18 * var_1_18)) ? (var_1_1 == ((unsigned char) (var_1_5 - (var_1_6 + var_1_7)))) : (var_1_1 == ((unsigned char) ((((var_1_7) < ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))) ? (var_1_7) : ((((((16) < 0 ) ? -(16) : (16))) + var_1_6))))))) && (((- var_1_18) > var_1_6) ? (var_1_8 == ((signed long int) ((var_1_9 - var_1_21) - var_1_5))) : 1)) && ((var_1_8 != ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))) ? (var_1_10 == ((float) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : ((var_1_13 || var_1_14) ? (var_1_10 == ((float) var_1_11)) : 1))) && (((var_1_12 / var_1_16) >= var_1_10) ? (var_1_15 == ((double) (var_1_17 + 255.5))) : 1)) && ((last_1_var_1_1 > last_1_var_1_18) ? (var_1_18 == ((unsigned long int) ((((var_1_9) < ((var_1_19 - var_1_6))) ? (var_1_9) : ((var_1_19 - var_1_6)))))) : ((var_1_20 || (var_1_9 >= last_1_var_1_22)) ? (var_1_18 == ((unsigned long int) var_1_6)) : (var_1_18 == ((unsigned long int) var_1_7))))) && (var_1_21 == ((signed short int) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) && ((var_1_18 == var_1_8) ? ((! var_1_20) ? (var_1_22 == ((signed char) ((((var_1_6) > ((5 - var_1_7))) ? (var_1_6) : ((5 - var_1_7)))))) : (var_1_22 == ((signed char) (var_1_7 + var_1_23)))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=8, last_1_var_1_1=5, last_1_var_1_22=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=0, var_1_18=2, var_1_19=-2147483649, var_1_1=189, var_1_20=-255, var_1_21=63, var_1_22=0, var_1_23=63, var_1_5=-770, var_1_6=-254, var_1_7=-193, var_1_8=1073741505, var_1_9=1073741822] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 933 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 670 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 263 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=3, InterpolantAutomatonStates: 28, 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, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 2376 SizeOfPredicates, 4 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4916/5060 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-10 07:53:51,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_50-while_file-12.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 41218f936bf95b34a4ca651f02a06980e6dee4f66c0a1bb8aa6f08c1f62da5e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:53:53,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:53:54,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:53:54,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:53:54,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:53:54,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:53:54,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:53:54,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:53:54,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:53:54,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:53:54,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:53:54,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:53:54,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:53:54,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:53:54,068 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:53:54,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:53:54,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:53:54,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:53:54,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:53:54,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:53:54,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:53:54,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:53:54,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:53:54,072 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:53:54,072 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:53:54,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:53:54,073 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:53:54,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:53:54,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:53:54,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:53:54,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:53:54,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:53:54,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:53:54,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:53:54,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:53:54,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:53:54,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:53:54,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:53:54,077 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:53:54,077 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:53:54,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:53:54,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:53:54,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:53:54,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:53:54,079 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 -> 41218f936bf95b34a4ca651f02a06980e6dee4f66c0a1bb8aa6f08c1f62da5e8 [2024-11-10 07:53:54,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:53:54,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:53:54,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:53:54,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:53:54,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:53:54,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-12.i [2024-11-10 07:53:55,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:53:56,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:53:56,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-12.i [2024-11-10 07:53:56,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b9f782f/459b419b825548038d28ba629506f934/FLAG7e991e015 [2024-11-10 07:53:56,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b9f782f/459b419b825548038d28ba629506f934 [2024-11-10 07:53:56,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:53:56,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:53:56,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:53:56,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:53:56,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:53:56,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279fb84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56, skipping insertion in model container [2024-11-10 07:53:56,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:53:56,455 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_loopvsstraightlinecode_50-while_file-12.i[915,928] [2024-11-10 07:53:56,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:53:56,547 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:53:56,560 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_loopvsstraightlinecode_50-while_file-12.i[915,928] [2024-11-10 07:53:56,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:53:56,623 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:53:56,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56 WrapperNode [2024-11-10 07:53:56,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:53:56,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:53:56,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:53:56,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:53:56,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,688 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-10 07:53:56,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:53:56,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:53:56,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:53:56,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:53:56,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,731 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-10 07:53:56,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:53:56,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:53:56,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:53:56,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:53:56,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (1/1) ... [2024-11-10 07:53:56,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:53:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:53:56,802 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-10 07:53:56,805 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-10 07:53:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:53:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:53:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:53:56,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:53:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:53:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:53:56,972 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:53:56,975 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:54:01,219 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 07:54:01,219 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:54:01,232 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:54:01,232 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:54:01,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:54:01 BoogieIcfgContainer [2024-11-10 07:54:01,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:54:01,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:54:01,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:54:01,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:54:01,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:53:56" (1/3) ... [2024-11-10 07:54:01,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596fa6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:54:01, skipping insertion in model container [2024-11-10 07:54:01,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:53:56" (2/3) ... [2024-11-10 07:54:01,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596fa6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:54:01, skipping insertion in model container [2024-11-10 07:54:01,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:54:01" (3/3) ... [2024-11-10 07:54:01,239 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-12.i [2024-11-10 07:54:01,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:54:01,256 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:54:01,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:54:01,326 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;@12d4789c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:54:01,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:54:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:54:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:54:01,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:54:01,347 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:54:01,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:54:01,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:54:01,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1163729006, now seen corresponding path program 1 times [2024-11-10 07:54:01,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:54:01,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858526258] [2024-11-10 07:54:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:01,367 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-10 07:54:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:54:01,370 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-10 07:54:01,372 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-10 07:54:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:01,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:54:01,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:54:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-10 07:54:02,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:54:02,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:54:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858526258] [2024-11-10 07:54:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858526258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:54:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:54:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:54:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602621428] [2024-11-10 07:54:02,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:54:02,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:54:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:54:02,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:54:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:54:02,051 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:54:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:54:02,081 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2024-11-10 07:54:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:54:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-11-10 07:54:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:54:02,097 INFO L225 Difference]: With dead ends: 130 [2024-11-10 07:54:02,098 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 07:54:02,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-10 07:54:02,109 INFO L432 NwaCegarLoop]: 95 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, 95 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-10 07:54:02,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:54:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 07:54:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 07:54:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:54:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-10 07:54:02,157 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 147 [2024-11-10 07:54:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:54:02,157 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-10 07:54:02,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:54:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-10 07:54:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:54:02,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:54:02,161 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:54:02,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:54:02,363 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-10 07:54:02,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:54:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:54:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 944211919, now seen corresponding path program 1 times [2024-11-10 07:54:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:54:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019819660] [2024-11-10 07:54:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:02,366 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-10 07:54:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:54:02,368 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-10 07:54:02,370 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-10 07:54:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:02,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:54:02,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:54:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:54:05,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:54:05,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:54:05,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019819660] [2024-11-10 07:54:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019819660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:54:05,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:54:05,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:54:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931941545] [2024-11-10 07:54:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:54:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:54:05,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:54:05,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:54:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:54:05,148 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:54:06,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:54:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:54:07,777 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2024-11-10 07:54:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:54:07,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-11-10 07:54:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:54:07,811 INFO L225 Difference]: With dead ends: 188 [2024-11-10 07:54:07,811 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 07:54:07,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:54:07,813 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:54:07,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 296 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 07:54:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 07:54:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2024-11-10 07:54:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 07:54:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2024-11-10 07:54:07,870 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 147 [2024-11-10 07:54:07,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:54:07,872 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2024-11-10 07:54:07,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:54:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2024-11-10 07:54:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:54:07,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:54:07,877 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:54:07,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:54:08,077 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-10 07:54:08,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:54:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:54:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 756971732, now seen corresponding path program 1 times [2024-11-10 07:54:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:54:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526400749] [2024-11-10 07:54:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:08,080 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-10 07:54:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:54:08,083 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-10 07:54:08,084 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-10 07:54:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:08,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 07:54:08,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:54:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-10 07:54:10,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:54:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:54:12,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:54:12,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526400749] [2024-11-10 07:54:12,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526400749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:54:12,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:54:12,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-11-10 07:54:12,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789815278] [2024-11-10 07:54:12,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:54:12,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 07:54:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:54:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 07:54:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:54:12,321 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-10 07:54:16,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:54:18,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:54:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:54:18,781 INFO L93 Difference]: Finished difference Result 294 states and 432 transitions. [2024-11-10 07:54:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 07:54:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 148 [2024-11-10 07:54:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:54:18,787 INFO L225 Difference]: With dead ends: 294 [2024-11-10 07:54:18,787 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 07:54:18,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2024-11-10 07:54:18,792 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 399 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:54:18,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 443 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-10 07:54:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 07:54:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2024-11-10 07:54:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 115 states have internal predecessors, (136), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-10 07:54:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2024-11-10 07:54:18,848 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 148 [2024-11-10 07:54:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:54:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2024-11-10 07:54:18,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-10 07:54:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2024-11-10 07:54:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:54:18,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:54:18,851 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:54:18,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 07:54:19,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:54:19,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:54:19,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:54:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1050374739, now seen corresponding path program 1 times [2024-11-10 07:54:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:54:19,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375395703] [2024-11-10 07:54:19,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:19,058 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-10 07:54:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:54:19,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:54:19,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 07:54:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:19,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 07:54:19,476 INFO L278 TraceCheckSpWp]: Computing forward predicates...