./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:24:58,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:24:58,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:24:58,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:24:58,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:24:58,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:24:58,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:24:58,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:24:58,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:24:58,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:24:58,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:24:58,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:24:58,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:24:58,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:24:58,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:24:58,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:24:58,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:24:58,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:24:58,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:24:58,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:24:58,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:24:58,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:24:58,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:24:58,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:24:58,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:24:58,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:24:58,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:24:58,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:24:58,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:24:58,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:24:58,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:24:58,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:24:58,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:24:58,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:24:58,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:24:58,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:24:58,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:24:58,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:24:58,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:24:58,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:24:58,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:24:58,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:24:58,830 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d [2024-11-20 07:24:59,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:24:59,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:24:59,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:24:59,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:24:59,039 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:24:59,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-11-20 07:25:00,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:25:00,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:25:00,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-11-20 07:25:00,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554c07763/6bf769e3c2a149178f044dfebb7a77d0/FLAG7a6584e1f [2024-11-20 07:25:00,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554c07763/6bf769e3c2a149178f044dfebb7a77d0 [2024-11-20 07:25:00,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:25:00,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:25:00,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:25:00,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:25:00,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:25:00,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204ee634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00, skipping insertion in model container [2024-11-20 07:25:00,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:25:00,593 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_operatoramount_amount100_file-98.i[916,929] [2024-11-20 07:25:00,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:25:00,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:25:00,717 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_operatoramount_amount100_file-98.i[916,929] [2024-11-20 07:25:00,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:25:00,756 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:25:00,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00 WrapperNode [2024-11-20 07:25:00,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:25:00,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:25:00,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:25:00,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:25:00,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,799 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-20 07:25:00,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:25:00,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:25:00,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:25:00,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:25:00,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,824 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:25:00,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:25:00,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:25:00,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:25:00,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:25:00,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (1/1) ... [2024-11-20 07:25:00,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:25:00,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:25:00,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:25:00,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:25:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:25:00,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:25:00,924 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:25:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:25:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:25:00,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:25:00,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:25:01,004 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:25:01,320 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 07:25:01,322 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:25:01,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:25:01,337 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:25:01,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:25:01 BoogieIcfgContainer [2024-11-20 07:25:01,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:25:01,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:25:01,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:25:01,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:25:01,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:25:00" (1/3) ... [2024-11-20 07:25:01,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55115751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:25:01, skipping insertion in model container [2024-11-20 07:25:01,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:00" (2/3) ... [2024-11-20 07:25:01,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55115751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:25:01, skipping insertion in model container [2024-11-20 07:25:01,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:25:01" (3/3) ... [2024-11-20 07:25:01,346 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-98.i [2024-11-20 07:25:01,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:25:01,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:25:01,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:25:01,412 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;@687c427e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:25:01,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:25:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 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-20 07:25:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 07:25:01,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:01,426 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, 1, 1, 1, 1] [2024-11-20 07:25:01,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:01,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2036502826, now seen corresponding path program 1 times [2024-11-20 07:25:01,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:01,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282024224] [2024-11-20 07:25:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 07:25:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:25:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:25:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:25:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:25:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:25:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:25:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:25:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:25:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:25:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:25:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 07:25:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:25:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:01,775 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-20 07:25:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282024224] [2024-11-20 07:25:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282024224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:25:01,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:25:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:25:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833826772] [2024-11-20 07:25:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:25:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:25:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:01,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:25:01,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:25:01,805 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-20 07:25:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:01,831 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions. [2024-11-20 07:25:01,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:25:01,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 152 [2024-11-20 07:25:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:01,839 INFO L225 Difference]: With dead ends: 147 [2024-11-20 07:25:01,839 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 07:25:01,842 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-20 07:25:01,845 INFO L432 NwaCegarLoop]: 112 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, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:01,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:25:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 07:25:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-20 07:25:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 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-20 07:25:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-20 07:25:01,875 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2024-11-20 07:25:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-20 07:25:01,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-20 07:25:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-20 07:25:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 07:25:01,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:01,879 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, 1, 1, 1, 1] [2024-11-20 07:25:01,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:25:01,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:01,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash -317854024, now seen corresponding path program 1 times [2024-11-20 07:25:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:01,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278011828] [2024-11-20 07:25:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 07:25:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:25:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:25:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:25:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:25:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:25:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:25:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:25:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:25:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:25:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:25:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 07:25:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:25:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:02,139 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-20 07:25:02,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278011828] [2024-11-20 07:25:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278011828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:25:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:25:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:25:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601294312] [2024-11-20 07:25:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:25:02,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:25:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:02,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:25:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:25:02,146 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (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-20 07:25:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:02,214 INFO L93 Difference]: Finished difference Result 211 states and 326 transitions. [2024-11-20 07:25:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:25:02,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (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 152 [2024-11-20 07:25:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:02,218 INFO L225 Difference]: With dead ends: 211 [2024-11-20 07:25:02,219 INFO L226 Difference]: Without dead ends: 141 [2024-11-20 07:25:02,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:25:02,221 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 97 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:02,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:25:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-20 07:25:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-20 07:25:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 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-20 07:25:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2024-11-20 07:25:02,245 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 152 [2024-11-20 07:25:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:02,248 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2024-11-20 07:25:02,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (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-20 07:25:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2024-11-20 07:25:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 07:25:02,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:02,250 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, 1, 1, 1, 1] [2024-11-20 07:25:02,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:25:02,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1457153338, now seen corresponding path program 1 times [2024-11-20 07:25:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807979842] [2024-11-20 07:25:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 07:25:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:25:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:25:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:25:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:25:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:25:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:25:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:25:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:25:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:25:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:25:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 07:25:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:25:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,118 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-20 07:25:03,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807979842] [2024-11-20 07:25:03,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807979842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:25:03,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:25:03,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:25:03,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689282700] [2024-11-20 07:25:03,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:25:03,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:25:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:25:03,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:25:03,123 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:25:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:03,346 INFO L93 Difference]: Finished difference Result 377 states and 575 transitions. [2024-11-20 07:25:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 07:25:03,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-20 07:25:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:03,351 INFO L225 Difference]: With dead ends: 377 [2024-11-20 07:25:03,351 INFO L226 Difference]: Without dead ends: 241 [2024-11-20 07:25:03,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:25:03,352 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 166 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:03,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 390 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:25:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-20 07:25:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 211. [2024-11-20 07:25:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 137 states have internal predecessors, (185), 69 states have call successors, (69), 4 states have call predecessors, (69), 4 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-20 07:25:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 323 transitions. [2024-11-20 07:25:03,379 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 323 transitions. Word has length 152 [2024-11-20 07:25:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:03,380 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 323 transitions. [2024-11-20 07:25:03,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:25:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 323 transitions. [2024-11-20 07:25:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 07:25:03,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:03,381 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, 1, 1, 1, 1] [2024-11-20 07:25:03,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:25:03,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:03,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:03,382 INFO L85 PathProgramCache]: Analyzing trace with hash -131194564, now seen corresponding path program 1 times [2024-11-20 07:25:03,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909012632] [2024-11-20 07:25:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 07:25:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:25:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:25:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:25:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:25:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:25:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:25:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:25:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:25:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:25:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:25:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 07:25:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:25:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:25:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909012632] [2024-11-20 07:25:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909012632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:25:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607861012] [2024-11-20 07:25:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:03,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:03,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:25:03,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:25:03,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 07:25:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:03,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 07:25:03,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:25:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-20 07:25:03,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:25:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:25:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607861012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:25:04,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:25:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 07:25:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202215814] [2024-11-20 07:25:04,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:25:04,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:25:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:25:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:25:04,097 INFO L87 Difference]: Start difference. First operand 211 states and 323 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 07:25:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:04,259 INFO L93 Difference]: Finished difference Result 445 states and 666 transitions. [2024-11-20 07:25:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:25:04,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152 [2024-11-20 07:25:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:04,264 INFO L225 Difference]: With dead ends: 445 [2024-11-20 07:25:04,265 INFO L226 Difference]: Without dead ends: 237 [2024-11-20 07:25:04,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:25:04,267 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 168 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:04,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 197 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:25:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-20 07:25:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223. [2024-11-20 07:25:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 146 states have internal predecessors, (189), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-20 07:25:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2024-11-20 07:25:04,304 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 152 [2024-11-20 07:25:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:04,305 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2024-11-20 07:25:04,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 07:25:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2024-11-20 07:25:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 07:25:04,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:04,307 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, 1, 1, 1, 1, 1] [2024-11-20 07:25:04,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 07:25:04,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:04,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:04,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1925501331, now seen corresponding path program 1 times [2024-11-20 07:25:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:04,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325261958] [2024-11-20 07:25:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 07:25:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:25:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:25:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:25:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:25:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:25:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:25:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:25:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:25:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:25:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:25:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 07:25:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:25:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:25:04,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325261958] [2024-11-20 07:25:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325261958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:25:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329759942] [2024-11-20 07:25:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:04,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:25:04,848 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-20 07:25:04,862 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-20 07:25:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:04,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 07:25:04,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:25:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-20 07:25:05,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:25:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:25:05,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329759942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:25:05,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:25:05,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2024-11-20 07:25:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232944650] [2024-11-20 07:25:05,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:25:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 07:25:05,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 07:25:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-20 07:25:05,723 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-20 07:25:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:06,356 INFO L93 Difference]: Finished difference Result 674 states and 982 transitions. [2024-11-20 07:25:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 07:25:06,356 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) Word has length 153 [2024-11-20 07:25:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:06,359 INFO L225 Difference]: With dead ends: 674 [2024-11-20 07:25:06,361 INFO L226 Difference]: Without dead ends: 454 [2024-11-20 07:25:06,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2024-11-20 07:25:06,363 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 231 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:06,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 748 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 07:25:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-20 07:25:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 280. [2024-11-20 07:25:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.2443181818181819) internal successors, (219), 176 states have internal predecessors, (219), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-20 07:25:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 403 transitions. [2024-11-20 07:25:06,409 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 403 transitions. Word has length 153 [2024-11-20 07:25:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:06,410 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 403 transitions. [2024-11-20 07:25:06,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-20 07:25:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 403 transitions. [2024-11-20 07:25:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 07:25:06,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:06,411 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, 1, 1, 1, 1, 1] [2024-11-20 07:25:06,419 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-20 07:25:06,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:06,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 375321259, now seen corresponding path program 1 times [2024-11-20 07:25:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451137416] [2024-11-20 07:25:06,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:13,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:25:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:25:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 07:25:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:13,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:25:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 07:25:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:25:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:25:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:25:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:25:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:25:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:25:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:25:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:25:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:25:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:25:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:25:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:25:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:25:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:25:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:25:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:25:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 07:25:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:25:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 129 proven. 51 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-20 07:25:14,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:25:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451137416] [2024-11-20 07:25:14,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451137416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:25:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576553016] [2024-11-20 07:25:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:14,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:14,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:25:14,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:25:14,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 07:25:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:25:14,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-20 07:25:14,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:25:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 563 proven. 156 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2024-11-20 07:25:16,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:25:30,481 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 07:25:37,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576553016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:25:37,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:25:37,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 40 [2024-11-20 07:25:37,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273976759] [2024-11-20 07:25:37,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:25:37,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-20 07:25:37,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:25:37,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-20 07:25:37,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2153, Unknown=1, NotChecked=0, Total=2450 [2024-11-20 07:25:37,719 INFO L87 Difference]: Start difference. First operand 280 states and 403 transitions. Second operand has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) [2024-11-20 07:25:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:25:50,711 INFO L93 Difference]: Finished difference Result 1443 states and 1945 transitions. [2024-11-20 07:25:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-20 07:25:50,712 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) Word has length 153 [2024-11-20 07:25:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:25:50,719 INFO L225 Difference]: With dead ends: 1443 [2024-11-20 07:25:50,719 INFO L226 Difference]: Without dead ends: 1299 [2024-11-20 07:25:50,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12619 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=5111, Invalid=32330, Unknown=1, NotChecked=0, Total=37442 [2024-11-20 07:25:50,728 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 2611 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 4340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:25:50,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2615 Valid, 1908 Invalid, 4340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-20 07:25:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2024-11-20 07:25:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 556. [2024-11-20 07:25:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 368 states have (on average 1.190217391304348) internal successors, (438), 368 states have internal predecessors, (438), 138 states have call successors, (138), 49 states have call predecessors, (138), 49 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-20 07:25:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 714 transitions. [2024-11-20 07:25:50,801 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 714 transitions. Word has length 153 [2024-11-20 07:25:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:25:50,802 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 714 transitions. [2024-11-20 07:25:50,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) [2024-11-20 07:25:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 714 transitions. [2024-11-20 07:25:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 07:25:50,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:25:50,804 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, 1, 1, 1, 1, 1] [2024-11-20 07:25:50,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 07:25:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:51,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:25:51,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:25:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1055379629, now seen corresponding path program 1 times [2024-11-20 07:25:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:25:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673958536] [2024-11-20 07:25:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:25:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:25:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280628920] [2024-11-20 07:25:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:25:51,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:51,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:25:51,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:25:51,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 07:25:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:25:51,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:25:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:25:51,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:25:51,369 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:25:51,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:25:51,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 07:25:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:25:51,579 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:25:51,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:25:51,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:25:51 BoogieIcfgContainer [2024-11-20 07:25:51,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:25:51,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:25:51,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:25:51,679 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:25:51,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:25:01" (3/4) ... [2024-11-20 07:25:51,681 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:25:51,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:25:51,683 INFO L158 Benchmark]: Toolchain (without parser) took 51270.44ms. Allocated memory was 174.1MB in the beginning and 572.5MB in the end (delta: 398.5MB). Free memory was 105.8MB in the beginning and 478.5MB in the end (delta: -372.6MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-20 07:25:51,683 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:25:51,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.69ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 141.0MB in the end (delta: -35.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 07:25:51,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.58ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 137.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:25:51,684 INFO L158 Benchmark]: Boogie Preprocessor took 48.84ms. Allocated memory is still 174.1MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:25:51,684 INFO L158 Benchmark]: RCFGBuilder took 487.49ms. Allocated memory is still 174.1MB. Free memory was 134.0MB in the beginning and 111.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 07:25:51,684 INFO L158 Benchmark]: TraceAbstraction took 50339.86ms. Allocated memory was 174.1MB in the beginning and 572.5MB in the end (delta: 398.5MB). Free memory was 110.3MB in the beginning and 478.5MB in the end (delta: -368.2MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-20 07:25:51,684 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 572.5MB. Free memory is still 478.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:25:51,685 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.12ms. Allocated memory is still 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.69ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 141.0MB in the end (delta: -35.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.58ms. Allocated memory is still 174.1MB. Free memory was 141.0MB in the beginning and 137.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.84ms. Allocated memory is still 174.1MB. Free memory was 137.5MB in the beginning and 134.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.49ms. Allocated memory is still 174.1MB. Free memory was 134.0MB in the beginning and 111.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 50339.86ms. Allocated memory was 174.1MB in the beginning and 572.5MB in the end (delta: 398.5MB). Free memory was 110.3MB in the beginning and 478.5MB in the end (delta: -368.2MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 572.5MB. Free memory is still 478.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -2; [L23] unsigned long int var_1_4 = 128; [L24] signed char var_1_5 = 100; [L25] signed char var_1_6 = 5; [L26] signed char var_1_7 = 25; [L27] signed long int var_1_8 = 0; [L28] signed long int var_1_9 = 100; [L29] signed char var_1_10 = 10; [L30] unsigned char var_1_11 = 1; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 63.5; [L34] float var_1_16 = 0.0; [L35] float var_1_17 = 8.16; [L36] float var_1_18 = 4.625; [L37] float var_1_19 = 1000000.2; [L38] float var_1_20 = 5.2; [L39] signed char var_1_21 = 8; [L40] signed long int var_1_22 = 64; [L41] signed char var_1_24 = 10; [L42] float var_1_25 = 0.0; [L43] float var_1_26 = 128.55; [L44] signed char var_1_27 = 16; [L45] unsigned long int var_1_28 = 256; [L46] signed short int var_1_29 = -128; [L47] signed char last_1_var_1_10 = 10; [L48] signed long int last_1_var_1_22 = 64; [L49] unsigned long int last_1_var_1_28 = 256; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L167] last_1_var_1_10 = var_1_10 [L168] last_1_var_1_22 = var_1_22 [L169] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L179] RET updateLastVariables() [L180] CALL updateVariables() [L128] var_1_4 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L132] var_1_5 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_5 >= 62) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L133] RET assume_abort_if_not(var_1_5 >= 62) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L135] var_1_6 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L136] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L137] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L137] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L138] var_1_7 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L139] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L140] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L140] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L141] var_1_9 = __VERIFIER_nondet_long() [L142] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L142] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L143] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L143] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L146] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L146] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L147] var_1_14 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L148] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L149] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L149] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L150] var_1_16 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L151] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L152] var_1_17 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_17 >= 0.0F && 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_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L153] RET assume_abort_if_not((var_1_17 >= 0.0F && 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_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L154] var_1_18 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L155] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L156] var_1_19 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L157] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L158] var_1_25 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L159] RET assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L160] var_1_26 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L161] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L162] var_1_27 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L163] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L164] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L164] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L180] RET updateVariables() [L181] CALL step() [L53] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L56] COND FALSE !(last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) [L59] var_1_21 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L62] COND FALSE !(last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L65] COND TRUE \read(var_1_12) [L66] var_1_11 = (((var_1_20 + 31.75f) <= 4.2f) && var_1_14) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L68] signed char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_0=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L69] COND TRUE stepLocal_0 != var_1_4 [L70] var_1_8 = ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L74] var_1_15 = ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19) [L75] unsigned char stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L76] COND TRUE var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26)) [L77] var_1_24 = (32 - (var_1_6 + var_1_27)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L89] COND FALSE !(\read(var_1_11)) [L98] var_1_28 = ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L100] signed long int stepLocal_1 = var_1_24 + (var_1_5 - var_1_7); VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_1=61, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L101] COND FALSE !(var_1_6 >= stepLocal_1) [L104] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L106] unsigned char stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L107] COND FALSE !(stepLocal_2 && var_1_11) [L110] var_1_22 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L112] COND FALSE !(10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L117] COND FALSE !((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) [L124] var_1_29 = var_1_27 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return (((((((((((10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? ((((((16u) < (var_1_22)) ? (16u) : (var_1_22))) >= (var_1_8 % var_1_4)) ? (var_1_1 == ((signed char) ((var_1_5 - var_1_6) - var_1_7))) : 1) : 1) && ((var_1_7 != var_1_4) ? (var_1_8 == ((signed long int) ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9))) : (var_1_8 == ((signed long int) var_1_21)))) && ((var_1_6 >= (var_1_24 + (var_1_5 - var_1_7))) ? (var_1_10 == ((signed char) (var_1_7 - var_1_6))) : (var_1_10 == ((signed char) var_1_7)))) && (var_1_12 ? (var_1_11 == ((unsigned char) (((var_1_20 + 31.75f) <= 4.2f) && var_1_14))) : 1)) && (var_1_15 == ((float) ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19)))) && ((last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) ? (var_1_20 == ((float) ((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16))))) : 1)) && (var_1_14 ? (var_1_21 == ((signed char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) : ((last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) ? (var_1_21 == ((signed char) var_1_6)) : (var_1_21 == ((signed char) var_1_7))))) && ((var_1_11 && var_1_11) ? (var_1_22 == ((signed long int) (((((var_1_6 + var_1_10) + var_1_21) < 0 ) ? -((var_1_6 + var_1_10) + var_1_21) : ((var_1_6 + var_1_10) + var_1_21))))) : (var_1_22 == ((signed long int) ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))))) && ((var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26))) ? (var_1_24 == ((signed char) (32 - (var_1_6 + var_1_27)))) : ((var_1_11 && (var_1_11 && var_1_14)) ? (var_1_24 == ((signed char) (var_1_6 + var_1_27))) : ((var_1_15 >= var_1_18) ? (var_1_24 == ((signed char) var_1_6)) : (var_1_24 == ((signed char) var_1_27)))))) && (var_1_11 ? ((! (var_1_20 >= var_1_16)) ? (var_1_28 == ((unsigned long int) (var_1_27 + var_1_5))) : (((- var_1_26) < (- (var_1_15 + var_1_17))) ? (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_27)) ? (var_1_7) : (var_1_27))))) : 1)) : (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))))))) && (((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) ? ((var_1_27 != (var_1_7 - var_1_6)) ? (var_1_29 == ((signed short int) (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - ((10000 - var_1_5) + var_1_27)))) : (var_1_29 == ((signed short int) var_1_10))) : (var_1_29 == ((signed short int) var_1_27))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.2s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3312 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3273 mSDsluCounter, 3645 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2959 mSDsCounter, 952 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4735 IncrementalHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 952 mSolverCounterUnsat, 686 mSDtfsCounter, 4735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1301 GetRequests, 1068 SyntacticMatches, 1 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12732 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=6, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 963 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 1678 NumberOfCodeBlocks, 1678 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 9061 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 10700/11132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 07:25:51,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:25:53,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:25:53,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:25:53,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:25:53,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:25:53,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:25:53,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:25:53,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:25:53,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:25:53,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:25:53,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:25:53,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:25:53,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:25:53,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:25:53,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:25:53,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:25:53,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:25:53,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:25:53,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:25:53,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:25:53,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:25:53,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:25:53,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:25:53,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:25:53,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:25:53,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:25:53,710 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:25:53,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:25:53,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:25:53,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:25:53,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:25:53,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:25:53,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:25:53,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:25:53,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:25:53,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:25:53,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:25:53,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:25:53,713 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:25:53,713 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:25:53,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:25:53,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:25:53,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:25:53,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:25:53,714 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d [2024-11-20 07:25:53,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:25:53,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:25:53,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:25:53,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:25:54,000 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:25:54,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-11-20 07:25:55,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:25:55,489 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:25:55,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-11-20 07:25:55,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1023625/2d1decd450e741d59892e89d0ea413ec/FLAGbc3d02a40 [2024-11-20 07:25:55,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1023625/2d1decd450e741d59892e89d0ea413ec [2024-11-20 07:25:55,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:25:55,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:25:55,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:25:55,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:25:55,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:25:55,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59568728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55, skipping insertion in model container [2024-11-20 07:25:55,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:25:55,714 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_operatoramount_amount100_file-98.i[916,929] [2024-11-20 07:25:55,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:25:55,809 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:25:55,820 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_operatoramount_amount100_file-98.i[916,929] [2024-11-20 07:25:55,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:25:55,875 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:25:55,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55 WrapperNode [2024-11-20 07:25:55,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:25:55,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:25:55,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:25:55,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:25:55,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,929 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-20 07:25:55,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:25:55,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:25:55,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:25:55,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:25:55,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,972 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:25:55,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:55,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:25:55,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:25:56,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:25:56,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:25:56,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (1/1) ... [2024-11-20 07:25:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:25:56,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:25:56,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:25:56,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:25:56,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:25:56,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:25:56,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:25:56,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:25:56,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:25:56,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:25:56,135 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:25:56,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:26:02,739 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 07:26:02,741 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:26:02,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:26:02,755 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:26:02,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:02 BoogieIcfgContainer [2024-11-20 07:26:02,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:26:02,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:26:02,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:26:02,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:26:02,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:25:55" (1/3) ... [2024-11-20 07:26:02,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecf0a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:02, skipping insertion in model container [2024-11-20 07:26:02,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:25:55" (2/3) ... [2024-11-20 07:26:02,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecf0a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:02, skipping insertion in model container [2024-11-20 07:26:02,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:02" (3/3) ... [2024-11-20 07:26:02,762 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-98.i [2024-11-20 07:26:02,776 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:26:02,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:26:02,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:26:02,835 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;@41612b62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:26:02,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:26:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 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-20 07:26:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 07:26:02,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:02,849 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, 1, 1, 1, 1] [2024-11-20 07:26:02,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:02,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2036502826, now seen corresponding path program 1 times [2024-11-20 07:26:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:26:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363157231] [2024-11-20 07:26:02,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:02,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:26:02,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:26:02,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:26:02,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 07:26:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:03,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:26:03,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:26:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-20 07:26:03,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:26:03,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:26:03,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363157231] [2024-11-20 07:26:03,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363157231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:03,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:03,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:26:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187788705] [2024-11-20 07:26:03,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:26:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:26:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:26:03,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:26:03,473 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-20 07:26:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:03,494 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions. [2024-11-20 07:26:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:26:03,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 152 [2024-11-20 07:26:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:03,506 INFO L225 Difference]: With dead ends: 147 [2024-11-20 07:26:03,506 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 07:26:03,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:26:03,511 INFO L432 NwaCegarLoop]: 112 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, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:03,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:26:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 07:26:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-20 07:26:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 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-20 07:26:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-20 07:26:03,547 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2024-11-20 07:26:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-20 07:26:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-20 07:26:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-20 07:26:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 07:26:03,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:03,552 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, 1, 1, 1, 1] [2024-11-20 07:26:03,570 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-20 07:26:03,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:26:03,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:03,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash -317854024, now seen corresponding path program 1 times [2024-11-20 07:26:03,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:26:03,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728092564] [2024-11-20 07:26:03,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:03,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:26:03,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:26:03,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:26:03,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 07:26:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:04,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 07:26:04,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:26:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-20 07:26:04,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:26:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:26:05,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:26:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728092564] [2024-11-20 07:26:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728092564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:26:05,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:26:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 07:26:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448059738] [2024-11-20 07:26:05,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:26:05,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:26:05,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:26:05,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:26:05,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:26:05,855 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 07:26:10,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:26:14,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:26:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:14,987 INFO L93 Difference]: Finished difference Result 151 states and 228 transitions. [2024-11-20 07:26:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:26:15,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152 [2024-11-20 07:26:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:15,033 INFO L225 Difference]: With dead ends: 151 [2024-11-20 07:26:15,033 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 07:26:15,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:26:15,034 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 117 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:15,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 195 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2024-11-20 07:26:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 07:26:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-20 07:26:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 07:26:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2024-11-20 07:26:15,045 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 152 [2024-11-20 07:26:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:15,046 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2024-11-20 07:26:15,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 07:26:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2024-11-20 07:26:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 07:26:15,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:15,053 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, 1, 1, 1, 1, 1] [2024-11-20 07:26:15,070 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-20 07:26:15,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:26:15,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2112160791, now seen corresponding path program 1 times [2024-11-20 07:26:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:26:15,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152639553] [2024-11-20 07:26:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:15,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:26:15,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:26:15,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:26:15,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 07:26:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:15,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 07:26:15,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:26:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 391 proven. 96 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-20 07:26:21,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:26:22,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:26:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152639553] [2024-11-20 07:26:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152639553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:26:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2109545532] [2024-11-20 07:26:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:22,336 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 07:26:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 07:26:22,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 07:26:22,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 07:26:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:22,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 07:26:22,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:26:22,844 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-20 07:26:22,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:26:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2109545532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:26:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-11-20 07:26:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789781433] [2024-11-20 07:26:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:26:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:26:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:26:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-20 07:26:22,846 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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)