./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_amount50_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.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 6333d5b58382f0356a7e2b673e2761c3d3694d8c0448ad6c2b79f49566360da8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:50:39,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:50:39,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:50:39,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:50:39,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:50:39,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:50:39,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:50:39,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:50:39,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:50:39,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:50:39,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:50:39,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:50:39,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:50:39,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:50:39,419 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:50:39,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:50:39,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:50:39,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:50:39,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:50:39,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:50:39,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:50:39,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:50:39,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:50:39,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:50:39,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:50:39,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:50:39,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:50:39,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:50:39,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:50:39,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:50:39,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:50:39,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:50:39,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:50:39,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:50:39,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:50:39,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:50:39,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:50:39,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:50:39,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:50:39,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:50:39,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:50:39,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:50:39,427 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 -> 6333d5b58382f0356a7e2b673e2761c3d3694d8c0448ad6c2b79f49566360da8 [2024-10-24 10:50:39,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:50:39,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:50:39,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:50:39,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:50:39,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:50:39,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i [2024-10-24 10:50:41,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:50:41,249 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:50:41,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i [2024-10-24 10:50:41,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b46c3a7/b3098fc03a2348a0827e757d2eb9ad25/FLAGdb3bbeb6f [2024-10-24 10:50:41,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b46c3a7/b3098fc03a2348a0827e757d2eb9ad25 [2024-10-24 10:50:41,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:50:41,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:50:41,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:50:41,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:50:41,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:50:41,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f8dab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41, skipping insertion in model container [2024-10-24 10:50:41,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:50:41,827 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i[915,928] [2024-10-24 10:50:41,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:50:41,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:50:41,883 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i[915,928] [2024-10-24 10:50:41,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:50:41,923 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:50:41,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41 WrapperNode [2024-10-24 10:50:41,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:50:41,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:50:41,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:50:41,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:50:41,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,956 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-24 10:50:41,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:50:41,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:50:41,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:50:41,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:50:41,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,978 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:50:41,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:50:41,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:50:41,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:50:41,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:50:41,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:50:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:50:42,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:50:42,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:50:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:50:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:50:42,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:50:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:50:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:50:42,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:50:42,141 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:50:42,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:50:42,483 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 10:50:42,483 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:50:42,539 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:50:42,539 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:50:42,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:50:42 BoogieIcfgContainer [2024-10-24 10:50:42,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:50:42,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:50:42,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:50:42,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:50:42,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:50:41" (1/3) ... [2024-10-24 10:50:42,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fc6a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:50:42, skipping insertion in model container [2024-10-24 10:50:42,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (2/3) ... [2024-10-24 10:50:42,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fc6a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:50:42, skipping insertion in model container [2024-10-24 10:50:42,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:50:42" (3/3) ... [2024-10-24 10:50:42,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-11.i [2024-10-24 10:50:42,563 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:50:42,563 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:50:42,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:50:42,632 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;@5f206501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:50:42,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:50:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:50:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 10:50:42,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:42,650 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:42,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:42,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1650630175, now seen corresponding path program 1 times [2024-10-24 10:50:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:50:42,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753315423] [2024-10-24 10:50:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:50:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:50:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:50:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:50:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:50:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:50:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:50:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:50:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:50:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:50:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:50:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:50:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:50:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:50:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:50:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:50:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:50:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:50:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:50:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:50:42,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753315423] [2024-10-24 10:50:42,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753315423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:50:42,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:50:42,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:50:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735322271] [2024-10-24 10:50:42,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:50:42,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:50:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:50:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:50:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:50:42,961 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:50:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:42,987 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2024-10-24 10:50:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:50:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-10-24 10:50:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:42,994 INFO L225 Difference]: With dead ends: 99 [2024-10-24 10:50:42,994 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 10:50:42,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:50:42,999 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:43,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:50:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 10:50:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 10:50:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:50:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-24 10:50:43,030 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 106 [2024-10-24 10:50:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:43,032 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-24 10:50:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:50:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-24 10:50:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 10:50:43,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:43,037 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:43,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:50:43,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:43,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:43,038 INFO L85 PathProgramCache]: Analyzing trace with hash 537031515, now seen corresponding path program 1 times [2024-10-24 10:50:43,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:50:43,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728058322] [2024-10-24 10:50:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:43,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:50:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:50:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:50:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:50:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:50:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:50:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:50:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:50:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:50:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:50:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:50:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:50:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:50:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:50:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:50:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:50:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:50:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:50:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:50:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:50:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728058322] [2024-10-24 10:50:43,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728058322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:50:43,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:50:43,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:50:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792013917] [2024-10-24 10:50:43,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:50:43,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:50:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:50:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:50:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:50:43,789 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:43,864 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2024-10-24 10:50:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:50:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-24 10:50:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:43,867 INFO L225 Difference]: With dead ends: 105 [2024-10-24 10:50:43,867 INFO L226 Difference]: Without dead ends: 57 [2024-10-24 10:50:43,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:50:43,868 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 28 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:43,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 186 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:50:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-24 10:50:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2024-10-24 10:50:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:50:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2024-10-24 10:50:43,883 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 106 [2024-10-24 10:50:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:43,887 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2024-10-24 10:50:43,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2024-10-24 10:50:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 10:50:43,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:43,889 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:43,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:50:43,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:43,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash 537091097, now seen corresponding path program 1 times [2024-10-24 10:50:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:50:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338387429] [2024-10-24 10:50:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:43,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:50:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:50:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:50:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:50:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:50:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:50:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:50:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:50:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:50:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:50:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:50:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:50:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:50:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:50:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:50:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:50:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:50:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:50:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:50:44,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:50:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338387429] [2024-10-24 10:50:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338387429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:50:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:50:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:50:44,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381771120] [2024-10-24 10:50:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:50:44,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:50:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:50:44,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:50:44,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:50:44,218 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:44,362 INFO L93 Difference]: Finished difference Result 152 states and 227 transitions. [2024-10-24 10:50:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:50:44,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-24 10:50:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:44,364 INFO L225 Difference]: With dead ends: 152 [2024-10-24 10:50:44,364 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 10:50:44,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:50:44,366 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 48 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:44,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 236 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:50:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 10:50:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-10-24 10:50:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 10:50:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-24 10:50:44,378 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 106 [2024-10-24 10:50:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-24 10:50:44,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-24 10:50:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:50:44,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:44,380 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:44,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:50:44,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:44,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1457824055, now seen corresponding path program 1 times [2024-10-24 10:50:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:50:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804767127] [2024-10-24 10:50:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:50:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:50:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:50:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:50:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:50:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:50:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:50:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:50:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:50:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:50:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:50:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:50:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:50:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:50:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:50:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:50:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:50:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:50:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 10:50:44,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:50:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804767127] [2024-10-24 10:50:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804767127] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:50:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002100847] [2024-10-24 10:50:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:44,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:50:44,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:50:44,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:50:44,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:50:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:44,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:50:44,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:50:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-10-24 10:50:45,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:50:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 10:50:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002100847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:50:45,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:50:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-24 10:50:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301087300] [2024-10-24 10:50:45,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:50:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 10:50:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:50:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 10:50:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:50:45,393 INFO L87 Difference]: Start difference. First operand 83 states and 124 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 10:50:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:45,617 INFO L93 Difference]: Finished difference Result 147 states and 211 transitions. [2024-10-24 10:50:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 10:50:45,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 107 [2024-10-24 10:50:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:45,620 INFO L225 Difference]: With dead ends: 147 [2024-10-24 10:50:45,620 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 10:50:45,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2024-10-24 10:50:45,624 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 118 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:45,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 104 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:50:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 10:50:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-10-24 10:50:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 10:50:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-10-24 10:50:45,649 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 107 [2024-10-24 10:50:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:45,649 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-10-24 10:50:45,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 10:50:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-10-24 10:50:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 10:50:45,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:45,651 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:45,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:50:45,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:50:45,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1742063087, now seen corresponding path program 1 times [2024-10-24 10:50:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:50:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133411847] [2024-10-24 10:50:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:50:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:50:45,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:50:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:50:46,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:50:46,073 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:50:46,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:50:46,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:50:46,078 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 10:50:46,143 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:50:46,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:50:46 BoogieIcfgContainer [2024-10-24 10:50:46,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:50:46,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:50:46,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:50:46,146 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:50:46,146 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:50:42" (3/4) ... [2024-10-24 10:50:46,148 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:50:46,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:50:46,149 INFO L158 Benchmark]: Toolchain (without parser) took 4522.56ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 90.2MB in the beginning and 80.0MB in the end (delta: 10.2MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. [2024-10-24 10:50:46,150 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:50:46,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.73ms. Allocated memory is still 144.7MB. Free memory was 89.8MB in the beginning and 74.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 10:50:46,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.53ms. Allocated memory is still 144.7MB. Free memory was 74.5MB in the beginning and 72.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:50:46,150 INFO L158 Benchmark]: Boogie Preprocessor took 35.97ms. Allocated memory is still 144.7MB. Free memory was 72.1MB in the beginning and 69.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:50:46,150 INFO L158 Benchmark]: RCFGBuilder took 546.62ms. Allocated memory is still 144.7MB. Free memory was 69.2MB in the beginning and 100.9MB in the end (delta: -31.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 10:50:46,151 INFO L158 Benchmark]: TraceAbstraction took 3604.40ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 100.2MB in the beginning and 80.0MB in the end (delta: 20.2MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. [2024-10-24 10:50:46,151 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 234.9MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:50:46,152 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.13ms. Allocated memory is still 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.73ms. Allocated memory is still 144.7MB. Free memory was 89.8MB in the beginning and 74.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.53ms. Allocated memory is still 144.7MB. Free memory was 74.5MB in the beginning and 72.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.97ms. Allocated memory is still 144.7MB. Free memory was 72.1MB in the beginning and 69.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.62ms. Allocated memory is still 144.7MB. Free memory was 69.2MB in the beginning and 100.9MB in the end (delta: -31.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3604.40ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 100.2MB in the beginning and 80.0MB in the end (delta: 20.2MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 234.9MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someUnaryDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] unsigned long int last_1_var_1_10 = 128; [L40] unsigned long int last_1_var_1_16 = 1; [L41] double last_1_var_1_19 = 3.8; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L116] last_1_var_1_10 = var_1_10 [L117] last_1_var_1_16 = var_1_16 [L118] last_1_var_1_19 = var_1_19 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L89] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L94] var_1_7 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L97] var_1_8 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=4] [L98] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=4] [L99] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=4] [L100] var_1_9 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L101] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L102] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L103] var_1_11 = __VERIFIER_nondet_ulong() [L104] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L104] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L105] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L106] var_1_17 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L107] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L108] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L109] var_1_18 = __VERIFIER_nondet_ulong() [L110] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L110] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L111] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L112] var_1_20 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L113] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L129] RET updateVariables() [L130] CALL step() [L45] unsigned long int stepLocal_1 = last_1_var_1_16; [L46] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L47] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L48] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=61, var_1_9=0] [L56] COND TRUE var_1_12 == var_1_12 [L57] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L59] var_1_1 = (var_1_2 || (! var_1_3)) [L60] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L61] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L62] COND TRUE var_1_19 != var_1_19 [L63] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=61, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L71] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=-50, var_1_16=61, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L72] COND FALSE !(var_1_19 >= var_1_19) [L77] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=0, var_1_16=61, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L82] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=0, var_1_16=61, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L83] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L84] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=0, var_1_16=61, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L130] RET step() [L131] CALL, EXPR property() [L121-L122] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=0, var_1_16=61, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543163, var_1_11=2147483646, var_1_12=8, var_1_15=0, var_1_16=61, var_1_17=-9223372026117357569, var_1_18=-9223372023969873922, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=69, var_1_7=0, var_1_8=61, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 597 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 251 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 3 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3147/3264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:50:46,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_amount50_file-11.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 6333d5b58382f0356a7e2b673e2761c3d3694d8c0448ad6c2b79f49566360da8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:50:48,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:50:48,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:50:48,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:50:48,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:50:48,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:50:48,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:50:48,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:50:48,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:50:48,292 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:50:48,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:50:48,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:50:48,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:50:48,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:50:48,295 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:50:48,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:50:48,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:50:48,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:50:48,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:50:48,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:50:48,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:50:48,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:50:48,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:50:48,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:50:48,300 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:50:48,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:50:48,300 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:50:48,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:50:48,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:50:48,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:50:48,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:50:48,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:50:48,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:50:48,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:50:48,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:50:48,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:50:48,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:50:48,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:50:48,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:50:48,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:50:48,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:50:48,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:50:48,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:50:48,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:50:48,304 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:50:48,305 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 -> 6333d5b58382f0356a7e2b673e2761c3d3694d8c0448ad6c2b79f49566360da8 [2024-10-24 10:50:48,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:50:48,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:50:48,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:50:48,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:50:48,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:50:48,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i [2024-10-24 10:50:50,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:50:50,205 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:50:50,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i [2024-10-24 10:50:50,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed54cbd8/593dda3a1b3743509951763c08eaa3b8/FLAG4789156c1 [2024-10-24 10:50:50,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed54cbd8/593dda3a1b3743509951763c08eaa3b8 [2024-10-24 10:50:50,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:50:50,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:50:50,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:50:50,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:50:50,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:50:50,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c207ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50, skipping insertion in model container [2024-10-24 10:50:50,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:50:50,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i[915,928] [2024-10-24 10:50:50,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:50:50,834 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:50:50,845 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-11.i[915,928] [2024-10-24 10:50:50,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:50:50,903 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:50:50,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50 WrapperNode [2024-10-24 10:50:50,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:50:50,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:50:50,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:50:50,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:50:50,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,958 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-24 10:50:50,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:50:50,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:50:50,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:50:50,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:50:50,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,986 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:50:50,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:50,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:51,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:51,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:51,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:51,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:50:51,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:50:51,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:50:51,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:50:51,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (1/1) ... [2024-10-24 10:50:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:50:51,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:50:51,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:50:51,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:50:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:50:51,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:50:51,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:50:51,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:50:51,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:50:51,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:50:51,165 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:50:51,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:50:51,428 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 10:50:51,428 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:50:51,478 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:50:51,478 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:50:51,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:50:51 BoogieIcfgContainer [2024-10-24 10:50:51,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:50:51,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:50:51,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:50:51,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:50:51,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:50:50" (1/3) ... [2024-10-24 10:50:51,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe813c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:50:51, skipping insertion in model container [2024-10-24 10:50:51,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:50" (2/3) ... [2024-10-24 10:50:51,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe813c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:50:51, skipping insertion in model container [2024-10-24 10:50:51,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:50:51" (3/3) ... [2024-10-24 10:50:51,486 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-11.i [2024-10-24 10:50:51,498 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:50:51,498 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:50:51,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:50:51,563 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;@258f25e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:50:51,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:50:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:50:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 10:50:51,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:51,576 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:51,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:51,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1650630175, now seen corresponding path program 1 times [2024-10-24 10:50:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:50:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173709954] [2024-10-24 10:50:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:51,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:50:51,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:50:51,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:50:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:51,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:50:51,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:50:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-10-24 10:50:51,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:50:51,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:50:51,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173709954] [2024-10-24 10:50:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173709954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:50:51,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:50:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:50:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148036393] [2024-10-24 10:50:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:50:51,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:50:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:50:51,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:50:51,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:50:51,782 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:50:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:51,834 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2024-10-24 10:50:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:50:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-10-24 10:50:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:51,844 INFO L225 Difference]: With dead ends: 99 [2024-10-24 10:50:51,844 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 10:50:51,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:50:51,849 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:51,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:50:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 10:50:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 10:50:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 10:50:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-24 10:50:51,877 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 106 [2024-10-24 10:50:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:51,877 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-24 10:50:51,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 10:50:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-24 10:50:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 10:50:51,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:51,880 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:51,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 10:50:52,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:52,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash 537031515, now seen corresponding path program 1 times [2024-10-24 10:50:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:50:52,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231186600] [2024-10-24 10:50:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:52,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:52,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:50:52,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:50:52,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:50:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:52,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 10:50:52,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:50:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:50:52,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:50:52,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:50:52,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231186600] [2024-10-24 10:50:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231186600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:50:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:50:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:50:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725578695] [2024-10-24 10:50:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:50:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:50:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:50:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:50:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:50:52,736 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:52,973 INFO L93 Difference]: Finished difference Result 146 states and 221 transitions. [2024-10-24 10:50:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:50:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-24 10:50:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:52,977 INFO L225 Difference]: With dead ends: 146 [2024-10-24 10:50:52,977 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 10:50:52,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:50:52,979 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 45 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:52,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 236 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:50:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 10:50:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2024-10-24 10:50:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 10:50:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2024-10-24 10:50:52,998 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 106 [2024-10-24 10:50:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:52,999 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2024-10-24 10:50:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2024-10-24 10:50:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:50:53,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:53,000 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:53,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 10:50:53,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:53,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:53,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:53,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1457764473, now seen corresponding path program 1 times [2024-10-24 10:50:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:50:53,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298931173] [2024-10-24 10:50:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:53,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:53,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:50:53,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:50:53,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:50:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:53,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 10:50:53,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:50:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 10:50:53,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:50:53,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:50:53,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298931173] [2024-10-24 10:50:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298931173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:50:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:50:53,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:50:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679124778] [2024-10-24 10:50:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:50:53,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:50:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:50:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:50:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:50:53,520 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:53,697 INFO L93 Difference]: Finished difference Result 133 states and 201 transitions. [2024-10-24 10:50:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:50:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-24 10:50:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:53,699 INFO L225 Difference]: With dead ends: 133 [2024-10-24 10:50:53,699 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 10:50:53,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:50:53,700 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 57 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:53,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 166 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:50:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 10:50:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-10-24 10:50:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 10:50:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2024-10-24 10:50:53,713 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 107 [2024-10-24 10:50:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:53,714 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2024-10-24 10:50:53,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 10:50:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2024-10-24 10:50:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 10:50:53,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:53,715 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:53,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 10:50:53,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:53,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 799390246, now seen corresponding path program 1 times [2024-10-24 10:50:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:50:53,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452671717] [2024-10-24 10:50:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:53,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:50:53,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:50:53,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 10:50:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:54,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 10:50:54,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:50:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-10-24 10:50:54,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:50:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 10:50:54,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:50:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452671717] [2024-10-24 10:50:54,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452671717] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:50:54,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:50:54,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 10:50:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458270799] [2024-10-24 10:50:54,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:50:54,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:50:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:50:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:50:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:50:54,421 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 10:50:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:54,676 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2024-10-24 10:50:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 10:50:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 108 [2024-10-24 10:50:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:54,684 INFO L225 Difference]: With dead ends: 145 [2024-10-24 10:50:54,685 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 10:50:54,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:50:54,686 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:54,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 96 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:50:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 10:50:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-10-24 10:50:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 10:50:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2024-10-24 10:50:54,700 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 108 [2024-10-24 10:50:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:54,701 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2024-10-24 10:50:54,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 10:50:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2024-10-24 10:50:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 10:50:54,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:54,706 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:50:54,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 10:50:54,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:54,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:54,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1691967057, now seen corresponding path program 1 times [2024-10-24 10:50:54,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:50:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634141131] [2024-10-24 10:50:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:54,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:50:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:50:54,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:50:54,915 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 (6)] Waiting until timeout for monitored process [2024-10-24 10:50:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:55,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 10:50:55,016 INFO L278 TraceCheckSpWp]: Computing forward predicates...