./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_fillercode_fillercodesize_normal_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercode_fillercodesize_normal_file-42.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 ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:52:23,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:52:23,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:52:24,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:52:24,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:52:24,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:52:24,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:52:24,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:52:24,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:52:24,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:52:24,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:52:24,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:52:24,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:52:24,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:52:24,038 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:52:24,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:52:24,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:52:24,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:52:24,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:52:24,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:52:24,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:52:24,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:52:24,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:52:24,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:52:24,044 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:52:24,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:52:24,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:52:24,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:52:24,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:52:24,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:52:24,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:52:24,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:52:24,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:52:24,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:52:24,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:52:24,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:52:24,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:52:24,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:52:24,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:52:24,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:52:24,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:52:24,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:52:24,051 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 -> ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 [2024-10-14 07:52:24,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:52:24,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:52:24,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:52:24,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:52:24,351 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:52:24,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-10-14 07:52:25,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:52:25,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:52:25,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-10-14 07:52:25,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6af5317a/607ddd48f5374ce29eb46748ed1ca1dc/FLAG241478046 [2024-10-14 07:52:25,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6af5317a/607ddd48f5374ce29eb46748ed1ca1dc [2024-10-14 07:52:25,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:52:25,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:52:25,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:52:25,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:52:25,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:52:25,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:52:25" (1/1) ... [2024-10-14 07:52:25,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc30534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:25, skipping insertion in model container [2024-10-14 07:52:25,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:52:25" (1/1) ... [2024-10-14 07:52:26,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:52:26,170 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_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-10-14 07:52:26,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:52:26,238 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:52:26,256 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_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-10-14 07:52:26,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:52:26,313 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:52:26,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26 WrapperNode [2024-10-14 07:52:26,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:52:26,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:52:26,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:52:26,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:52:26,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,375 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-14 07:52:26,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:52:26,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:52:26,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:52:26,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:52:26,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,435 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-14 07:52:26,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:52:26,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:52:26,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:52:26,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:52:26,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (1/1) ... [2024-10-14 07:52:26,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:52:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:52:26,506 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-14 07:52:26,510 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-14 07:52:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:52:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:52:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:52:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:52:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:52:26,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:52:26,640 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:52:26,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:52:26,960 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 07:52:26,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:52:26,999 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:52:27,000 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:52:27,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:52:27 BoogieIcfgContainer [2024-10-14 07:52:27,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:52:27,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:52:27,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:52:27,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:52:27,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:52:25" (1/3) ... [2024-10-14 07:52:27,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c11955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:52:27, skipping insertion in model container [2024-10-14 07:52:27,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:26" (2/3) ... [2024-10-14 07:52:27,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c11955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:52:27, skipping insertion in model container [2024-10-14 07:52:27,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:52:27" (3/3) ... [2024-10-14 07:52:27,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-42.i [2024-10-14 07:52:27,032 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:52:27,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:52:27,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:52:27,102 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;@29a836dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:52:27,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:52:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:52:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 07:52:27,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:27,130 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:27,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:27,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1441148856, now seen corresponding path program 1 times [2024-10-14 07:52:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:27,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415066502] [2024-10-14 07:52:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:52:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:52:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:52:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:52:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:52:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:52:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:52:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415066502] [2024-10-14 07:52:27,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415066502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:27,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:27,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:52:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293418516] [2024-10-14 07:52:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:27,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:52:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:52:27,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:52:27,663 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:52:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:27,705 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2024-10-14 07:52:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:52:27,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-14 07:52:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:27,714 INFO L225 Difference]: With dead ends: 91 [2024-10-14 07:52:27,714 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 07:52:27,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-14 07:52:27,720 INFO L432 NwaCegarLoop]: 64 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, 64 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-14 07:52:27,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:52:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 07:52:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 07:52:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:52:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-14 07:52:27,753 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 83 [2024-10-14 07:52:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-14 07:52:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:52:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-14 07:52:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 07:52:27,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:27,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:27,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:52:27,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:27,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2116648844, now seen corresponding path program 1 times [2024-10-14 07:52:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:27,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457609780] [2024-10-14 07:52:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:52:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:52:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:52:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:52:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:52:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:52:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:52:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457609780] [2024-10-14 07:52:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457609780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:52:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817824824] [2024-10-14 07:52:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:28,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:52:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:52:28,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:52:28,284 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:28,432 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-14 07:52:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:52:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-14 07:52:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:28,435 INFO L225 Difference]: With dead ends: 134 [2024-10-14 07:52:28,436 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 07:52:28,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-14 07:52:28,439 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 66 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:28,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 186 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:52:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 07:52:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2024-10-14 07:52:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 07:52:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2024-10-14 07:52:28,459 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 83 [2024-10-14 07:52:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2024-10-14 07:52:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2024-10-14 07:52:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:28,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:28,464 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:52:28,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:28,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:28,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2013944679, now seen corresponding path program 1 times [2024-10-14 07:52:28,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:28,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259097175] [2024-10-14 07:52:28,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:52:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:52:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:52:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:52:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:52:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:52:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:52:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259097175] [2024-10-14 07:52:28,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259097175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:28,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:28,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:52:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339988835] [2024-10-14 07:52:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:28,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:52:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:52:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:52:28,942 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:29,243 INFO L93 Difference]: Finished difference Result 201 states and 301 transitions. [2024-10-14 07:52:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:52:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-14 07:52:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:29,251 INFO L225 Difference]: With dead ends: 201 [2024-10-14 07:52:29,252 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 07:52:29,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:52:29,254 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 95 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:29,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 279 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:52:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 07:52:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2024-10-14 07:52:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 07:52:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-10-14 07:52:29,294 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 84 [2024-10-14 07:52:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:29,294 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-14 07:52:29,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-10-14 07:52:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:29,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:29,300 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:29,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:52:29,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1002827429, now seen corresponding path program 1 times [2024-10-14 07:52:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:29,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690358449] [2024-10-14 07:52:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:52:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:52:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:52:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:52:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:52:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:52:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:52:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:29,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690358449] [2024-10-14 07:52:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690358449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:29,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:29,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:52:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190047298] [2024-10-14 07:52:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:29,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:52:29,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:29,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:52:29,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:52:29,504 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:29,552 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2024-10-14 07:52:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:52:29,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-14 07:52:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:29,559 INFO L225 Difference]: With dead ends: 198 [2024-10-14 07:52:29,559 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 07:52:29,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:52:29,561 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:29,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:52:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 07:52:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 07:52:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 07:52:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2024-10-14 07:52:29,597 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 84 [2024-10-14 07:52:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:29,597 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2024-10-14 07:52:29,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2024-10-14 07:52:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:29,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:29,600 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:52:29,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:29,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:29,602 INFO L85 PathProgramCache]: Analyzing trace with hash 193480803, now seen corresponding path program 1 times [2024-10-14 07:52:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:29,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877037196] [2024-10-14 07:52:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:29,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:52:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:52:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:52:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:52:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:52:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:52:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:52:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:52:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:52:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:52:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:52:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:52:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-14 07:52:30,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877037196] [2024-10-14 07:52:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877037196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:52:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401856707] [2024-10-14 07:52:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:30,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:52:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:52:30,215 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-14 07:52:30,217 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-14 07:52:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:30,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 07:52:30,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-14 07:52:30,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:52:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-14 07:52:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401856707] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:52:30,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:52:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-14 07:52:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043816836] [2024-10-14 07:52:30,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:52:30,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:52:30,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:52:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:52:30,963 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 07:52:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:31,836 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2024-10-14 07:52:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-14 07:52:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 84 [2024-10-14 07:52:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:31,840 INFO L225 Difference]: With dead ends: 367 [2024-10-14 07:52:31,840 INFO L226 Difference]: Without dead ends: 323 [2024-10-14 07:52:31,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 07:52:31,842 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 298 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:31,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 312 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:52:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-14 07:52:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2024-10-14 07:52:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 134 states have internal predecessors, (168), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:52:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2024-10-14 07:52:31,896 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 84 [2024-10-14 07:52:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:31,899 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2024-10-14 07:52:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 07:52:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2024-10-14 07:52:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:31,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:31,901 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:31,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:52:32,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:52:32,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:32,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash -393325211, now seen corresponding path program 1 times [2024-10-14 07:52:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:32,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520636181] [2024-10-14 07:52:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:52:32,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466657415] [2024-10-14 07:52:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:32,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:52:32,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:52:32,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:52:32,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 07:52:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:32,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 07:52:32,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-14 07:52:32,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:52:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520636181] [2024-10-14 07:52:33,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 07:52:33,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466657415] [2024-10-14 07:52:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466657415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:52:33,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:52:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-14 07:52:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443621829] [2024-10-14 07:52:33,438 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 07:52:33,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 07:52:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 07:52:33,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=237, Unknown=6, NotChecked=0, Total=342 [2024-10-14 07:52:33,439 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 07:52:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:34,125 INFO L93 Difference]: Finished difference Result 606 states and 791 transitions. [2024-10-14 07:52:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 07:52:34,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 84 [2024-10-14 07:52:34,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:34,130 INFO L225 Difference]: With dead ends: 606 [2024-10-14 07:52:34,130 INFO L226 Difference]: Without dead ends: 505 [2024-10-14 07:52:34,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=726, Unknown=6, NotChecked=0, Total=1056 [2024-10-14 07:52:34,132 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 141 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:34,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 483 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:52:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-10-14 07:52:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 421. [2024-10-14 07:52:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 301 states have (on average 1.2458471760797343) internal successors, (375), 303 states have internal predecessors, (375), 88 states have call successors, (88), 31 states have call predecessors, (88), 31 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-14 07:52:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 551 transitions. [2024-10-14 07:52:34,202 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 551 transitions. Word has length 84 [2024-10-14 07:52:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:34,203 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 551 transitions. [2024-10-14 07:52:34,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 07:52:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 551 transitions. [2024-10-14 07:52:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:34,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:34,207 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:34,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 07:52:34,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 07:52:34,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:34,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash -135159773, now seen corresponding path program 1 times [2024-10-14 07:52:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969006210] [2024-10-14 07:52:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:52:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025452047] [2024-10-14 07:52:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:34,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:52:34,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:52:34,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:52:34,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 07:52:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:34,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 07:52:34,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 07:52:35,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:52:35,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:52:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969006210] [2024-10-14 07:52:35,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 07:52:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025452047] [2024-10-14 07:52:35,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025452047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:52:35,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:52:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-14 07:52:35,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142713185] [2024-10-14 07:52:35,711 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 07:52:35,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:52:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:52:35,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:52:35,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-14 07:52:35,712 INFO L87 Difference]: Start difference. First operand 421 states and 551 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:52:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:36,473 INFO L93 Difference]: Finished difference Result 824 states and 1089 transitions. [2024-10-14 07:52:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 07:52:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2024-10-14 07:52:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:36,480 INFO L225 Difference]: With dead ends: 824 [2024-10-14 07:52:36,480 INFO L226 Difference]: Without dead ends: 669 [2024-10-14 07:52:36,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-14 07:52:36,482 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 140 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 41 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:36,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 442 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 403 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:52:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-10-14 07:52:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 536. [2024-10-14 07:52:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 382 states have (on average 1.2356020942408377) internal successors, (472), 384 states have internal predecessors, (472), 112 states have call successors, (112), 41 states have call predecessors, (112), 41 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-14 07:52:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 696 transitions. [2024-10-14 07:52:36,575 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 696 transitions. Word has length 84 [2024-10-14 07:52:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:36,576 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 696 transitions. [2024-10-14 07:52:36,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:52:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 696 transitions. [2024-10-14 07:52:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:52:36,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:36,577 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:36,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 07:52:36,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:52:36,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:36,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1882768435, now seen corresponding path program 1 times [2024-10-14 07:52:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:52:36,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570303943] [2024-10-14 07:52:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:52:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:52:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384059499] [2024-10-14 07:52:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:36,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:52:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:52:36,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:52:36,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 07:52:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:52:36,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:52:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:52:37,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:52:37,056 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:52:37,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:52:37,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 07:52:37,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:52:37,262 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:52:37,335 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:52:37,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:52:37 BoogieIcfgContainer [2024-10-14 07:52:37,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:52:37,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:52:37,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:52:37,341 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:52:37,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:52:27" (3/4) ... [2024-10-14 07:52:37,343 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:52:37,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:52:37,345 INFO L158 Benchmark]: Toolchain (without parser) took 11365.68ms. Allocated memory was 161.5MB in the beginning and 272.6MB in the end (delta: 111.1MB). Free memory was 104.8MB in the beginning and 111.5MB in the end (delta: -6.8MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2024-10-14 07:52:37,345 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:52:37,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.48ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 90.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:52:37,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.75ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 86.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:52:37,346 INFO L158 Benchmark]: Boogie Preprocessor took 92.45ms. Allocated memory is still 161.5MB. Free memory was 86.5MB in the beginning and 81.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:52:37,346 INFO L158 Benchmark]: RCFGBuilder took 531.11ms. Allocated memory is still 161.5MB. Free memory was 81.4MB in the beginning and 57.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 07:52:37,347 INFO L158 Benchmark]: TraceAbstraction took 10336.92ms. Allocated memory was 161.5MB in the beginning and 272.6MB in the end (delta: 111.1MB). Free memory was 56.5MB in the beginning and 111.5MB in the end (delta: -55.0MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-10-14 07:52:37,347 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 272.6MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:52:37,348 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.21ms. Allocated memory is still 161.5MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.48ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 90.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.75ms. Allocated memory is still 161.5MB. Free memory was 90.1MB in the beginning and 86.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.45ms. Allocated memory is still 161.5MB. Free memory was 86.5MB in the beginning and 81.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 531.11ms. Allocated memory is still 161.5MB. Free memory was 81.4MB in the beginning and 57.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10336.92ms. Allocated memory was 161.5MB in the beginning and 272.6MB in the end (delta: 111.1MB). Free memory was 56.5MB in the beginning and 111.5MB in the end (delta: -55.0MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 272.6MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 754 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 1881 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1355 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1236 IncrementalHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 526 mSDtfsCounter, 1236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 684 GetRequests, 574 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 410 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 745 ConstructedInterpolants, 1 QuantifiedInterpolants, 3650 SizeOfPredicates, 17 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 2271/2376 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-14 07:52:37,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.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 ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:52:39,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:52:39,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:52:39,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:52:39,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:52:39,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:52:39,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:52:39,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:52:39,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:52:39,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:52:39,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:52:39,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:52:39,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:52:39,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:52:39,721 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:52:39,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:52:39,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:52:39,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:52:39,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:52:39,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:52:39,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:52:39,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:52:39,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:52:39,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:52:39,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:52:39,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:52:39,725 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:52:39,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:52:39,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:52:39,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:52:39,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:52:39,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:52:39,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:52:39,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:52:39,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:52:39,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:52:39,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:52:39,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:52:39,731 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:52:39,731 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:52:39,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:52:39,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:52:39,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:52:39,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:52:39,733 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:52:39,733 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 -> ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 [2024-10-14 07:52:40,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:52:40,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:52:40,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:52:40,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:52:40,090 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:52:40,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-10-14 07:52:41,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:52:41,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:52:41,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-10-14 07:52:41,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86a2ab82/aaa8ba07fb424679bee429662b47a887/FLAGb65328e63 [2024-10-14 07:52:41,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86a2ab82/aaa8ba07fb424679bee429662b47a887 [2024-10-14 07:52:41,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:52:41,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:52:41,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:52:41,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:52:41,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:52:41,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:52:41" (1/1) ... [2024-10-14 07:52:41,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afdeeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:41, skipping insertion in model container [2024-10-14 07:52:41,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:52:41" (1/1) ... [2024-10-14 07:52:41,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:52:42,089 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_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-10-14 07:52:42,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:52:42,204 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:52:42,220 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_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-10-14 07:52:42,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:52:42,281 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:52:42,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42 WrapperNode [2024-10-14 07:52:42,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:52:42,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:52:42,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:52:42,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:52:42,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,340 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-14 07:52:42,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:52:42,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:52:42,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:52:42,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:52:42,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,382 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-14 07:52:42,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:52:42,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:52:42,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:52:42,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:52:42,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (1/1) ... [2024-10-14 07:52:42,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:52:42,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:52:42,463 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-14 07:52:42,470 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-14 07:52:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:52:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:52:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:52:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:52:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:52:42,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:52:42,625 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:52:42,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:52:43,110 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 07:52:43,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:52:43,178 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:52:43,178 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:52:43,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:52:43 BoogieIcfgContainer [2024-10-14 07:52:43,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:52:43,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:52:43,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:52:43,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:52:43,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:52:41" (1/3) ... [2024-10-14 07:52:43,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f2fe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:52:43, skipping insertion in model container [2024-10-14 07:52:43,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:52:42" (2/3) ... [2024-10-14 07:52:43,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f2fe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:52:43, skipping insertion in model container [2024-10-14 07:52:43,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:52:43" (3/3) ... [2024-10-14 07:52:43,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-42.i [2024-10-14 07:52:43,220 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:52:43,220 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:52:43,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:52:43,296 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;@33288cd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:52:43,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:52:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:52:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 07:52:43,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:43,313 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:43,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:43,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1441148856, now seen corresponding path program 1 times [2024-10-14 07:52:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:52:43,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566470480] [2024-10-14 07:52:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:43,340 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-14 07:52:43,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:52:43,344 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-14 07:52:43,346 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-14 07:52:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:43,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:52:43,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-14 07:52:43,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:52:43,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:52:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566470480] [2024-10-14 07:52:43,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566470480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:43,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:43,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:52:43,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338356661] [2024-10-14 07:52:43,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:43,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:52:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:52:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:52:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:52:43,667 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:52:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:43,833 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2024-10-14 07:52:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:52:43,842 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-14 07:52:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:43,850 INFO L225 Difference]: With dead ends: 91 [2024-10-14 07:52:43,850 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 07:52:43,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 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-14 07:52:43,860 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:43,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:52:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 07:52:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 07:52:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:52:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-14 07:52:43,914 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 83 [2024-10-14 07:52:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:43,915 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-14 07:52:43,915 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:52:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-14 07:52:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 07:52:43,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:43,921 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:43,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:52:44,125 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-14 07:52:44,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:44,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2116648844, now seen corresponding path program 1 times [2024-10-14 07:52:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:52:44,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705058140] [2024-10-14 07:52:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:44,129 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-14 07:52:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:52:44,132 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-14 07:52:44,133 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-14 07:52:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:44,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 07:52:44,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:44,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:52:44,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:52:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705058140] [2024-10-14 07:52:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705058140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:44,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:52:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434737532] [2024-10-14 07:52:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:44,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:52:44,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:52:44,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:52:44,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:52:44,612 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:44,903 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-14 07:52:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:52:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-14 07:52:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:44,911 INFO L225 Difference]: With dead ends: 134 [2024-10-14 07:52:44,911 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 07:52:44,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-14 07:52:44,913 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 63 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:44,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 186 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:52:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 07:52:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2024-10-14 07:52:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 07:52:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2024-10-14 07:52:44,938 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 83 [2024-10-14 07:52:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:44,939 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2024-10-14 07:52:44,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2024-10-14 07:52:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:44,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:44,941 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:44,949 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-14 07:52:45,141 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-14 07:52:45,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2013944679, now seen corresponding path program 1 times [2024-10-14 07:52:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:52:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205644481] [2024-10-14 07:52:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:45,145 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-14 07:52:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:52:45,146 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-14 07:52:45,147 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-14 07:52:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:45,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 07:52:45,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:45,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:52:45,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:52:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205644481] [2024-10-14 07:52:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205644481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:45,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:45,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:52:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530828309] [2024-10-14 07:52:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:45,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:52:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:52:45,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:52:45,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:52:45,821 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:46,494 INFO L93 Difference]: Finished difference Result 201 states and 301 transitions. [2024-10-14 07:52:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:52:46,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-14 07:52:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:46,502 INFO L225 Difference]: With dead ends: 201 [2024-10-14 07:52:46,502 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 07:52:46,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:52:46,504 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 92 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:46,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 279 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:52:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 07:52:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2024-10-14 07:52:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 07:52:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-10-14 07:52:46,532 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 84 [2024-10-14 07:52:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:46,533 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-14 07:52:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-10-14 07:52:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:46,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:46,537 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:46,545 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-14 07:52:46,737 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-14 07:52:46,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1002827429, now seen corresponding path program 1 times [2024-10-14 07:52:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:52:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692526636] [2024-10-14 07:52:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:46,739 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-14 07:52:46,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:52:46,745 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-14 07:52:46,746 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-14 07:52:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:46,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 07:52:46,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:46,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:52:46,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:52:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692526636] [2024-10-14 07:52:46,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692526636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:46,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:52:46,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:52:46,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936053776] [2024-10-14 07:52:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:46,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:52:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:52:46,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:52:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:52:46,937 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:47,170 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2024-10-14 07:52:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:52:47,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-14 07:52:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:47,180 INFO L225 Difference]: With dead ends: 198 [2024-10-14 07:52:47,180 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 07:52:47,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:52:47,185 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:47,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:52:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 07:52:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 07:52:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 07:52:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2024-10-14 07:52:47,215 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 84 [2024-10-14 07:52:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:47,216 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2024-10-14 07:52:47,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2024-10-14 07:52:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:47,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:47,221 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:47,229 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-14 07:52:47,421 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-14 07:52:47,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:47,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 193480803, now seen corresponding path program 1 times [2024-10-14 07:52:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:52:47,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660796293] [2024-10-14 07:52:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:47,423 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-14 07:52:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:52:47,425 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-14 07:52:47,426 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-14 07:52:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:47,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 07:52:47,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-14 07:52:47,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:52:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-14 07:52:48,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:52:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660796293] [2024-10-14 07:52:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660796293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:52:48,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:52:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-14 07:52:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808232323] [2024-10-14 07:52:48,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:52:48,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:52:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:52:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:52:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:52:48,158 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 07:52:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:49,005 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2024-10-14 07:52:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 07:52:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 84 [2024-10-14 07:52:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:49,009 INFO L225 Difference]: With dead ends: 265 [2024-10-14 07:52:49,010 INFO L226 Difference]: Without dead ends: 221 [2024-10-14 07:52:49,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 07:52:49,013 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 226 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:49,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 276 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:52:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-14 07:52:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 195. [2024-10-14 07:52:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 134 states have internal predecessors, (168), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:52:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2024-10-14 07:52:49,048 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 84 [2024-10-14 07:52:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2024-10-14 07:52:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 07:52:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2024-10-14 07:52:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:49,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:49,051 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:49,064 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 (6)] Ended with exit code 0 [2024-10-14 07:52:49,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-14 07:52:49,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash -393325211, now seen corresponding path program 1 times [2024-10-14 07:52:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:52:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854380555] [2024-10-14 07:52:49,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:49,253 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-14 07:52:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:52:49,255 INFO L229 MonitoredProcess]: Starting monitored process 7 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-14 07:52:49,256 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 (7)] Waiting until timeout for monitored process [2024-10-14 07:52:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:49,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 07:52:49,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 07:52:49,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:52:50,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:52:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854380555] [2024-10-14 07:52:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854380555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:52:50,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [848988498] [2024-10-14 07:52:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:50,282 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 07:52:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 07:52:50,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 07:52:50,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-14 07:52:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:50,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-14 07:52:50,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:52:55,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:52:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [848988498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:52:55,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:52:55,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-14 07:52:55,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851725883] [2024-10-14 07:52:55,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:52:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:52:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:52:55,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:52:55,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:52:55,086 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:52:56,113 INFO L93 Difference]: Finished difference Result 375 states and 507 transitions. [2024-10-14 07:52:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:52:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-14 07:52:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:52:56,116 INFO L225 Difference]: With dead ends: 375 [2024-10-14 07:52:56,116 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 07:52:56,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-14 07:52:56,118 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 80 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 07:52:56,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 179 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 07:52:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 07:52:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 197. [2024-10-14 07:52:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 136 states have (on average 1.2426470588235294) internal successors, (169), 136 states have internal predecessors, (169), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:52:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2024-10-14 07:52:56,163 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 84 [2024-10-14 07:52:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:52:56,163 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2024-10-14 07:52:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:52:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2024-10-14 07:52:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 07:52:56,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:52:56,169 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:52:56,179 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 (7)] Ended with exit code 0 [2024-10-14 07:52:56,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-14 07:52:56,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 07:52:56,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:52:56,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:52:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash -135159773, now seen corresponding path program 1 times [2024-10-14 07:52:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:52:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440427312] [2024-10-14 07:52:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:56,572 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-14 07:52:56,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:52:56,575 INFO L229 MonitoredProcess]: Starting monitored process 9 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-14 07:52:56,577 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 (9)] Waiting until timeout for monitored process [2024-10-14 07:52:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:56,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 07:52:56,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:52:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 07:52:57,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:52:57,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:52:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440427312] [2024-10-14 07:52:57,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440427312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:52:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [382543781] [2024-10-14 07:52:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:52:57,397 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 07:52:57,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 07:52:57,399 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 07:52:57,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-14 07:52:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:52:57,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-14 07:52:57,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:53:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:53:01,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:53:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [382543781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:53:01,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:53:01,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-14 07:53:01,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399745624] [2024-10-14 07:53:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:53:01,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:53:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:53:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:53:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:53:01,450 INFO L87 Difference]: Start difference. First operand 197 states and 265 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:53:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:53:02,369 INFO L93 Difference]: Finished difference Result 320 states and 428 transitions. [2024-10-14 07:53:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:53:02,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-14 07:53:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:53:02,372 INFO L225 Difference]: With dead ends: 320 [2024-10-14 07:53:02,372 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 07:53:02,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-14 07:53:02,373 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 37 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:53:02,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 172 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:53:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 07:53:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2024-10-14 07:53:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 134 states have internal predecessors, (166), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:53:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 262 transitions. [2024-10-14 07:53:02,397 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 262 transitions. Word has length 84 [2024-10-14 07:53:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:53:02,399 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 262 transitions. [2024-10-14 07:53:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:53:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 262 transitions. [2024-10-14 07:53:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:53:02,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:53:02,400 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:53:02,410 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 (9)] Forceful destruction successful, exit code 0 [2024-10-14 07:53:02,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-10-14 07:53:02,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 07:53:02,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:53:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:53:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -943405319, now seen corresponding path program 1 times [2024-10-14 07:53:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:53:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450975708] [2024-10-14 07:53:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:53:02,803 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-14 07:53:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:53:02,806 INFO L229 MonitoredProcess]: Starting monitored process 11 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-14 07:53:02,808 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 (11)] Waiting until timeout for monitored process [2024-10-14 07:53:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:53:02,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 07:53:02,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:53:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 07:53:03,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:53:03,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:53:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450975708] [2024-10-14 07:53:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450975708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:53:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1189437157] [2024-10-14 07:53:03,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:53:03,535 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 07:53:03,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 07:53:03,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 07:53:03,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-14 07:53:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:53:03,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-14 07:53:03,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:53:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:53:06,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:53:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1189437157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:53:06,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:53:06,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-14 07:53:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856695316] [2024-10-14 07:53:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:53:06,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:53:06,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:53:06,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:53:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-14 07:53:06,276 INFO L87 Difference]: Start difference. First operand 195 states and 262 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:53:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:53:07,752 INFO L93 Difference]: Finished difference Result 313 states and 418 transitions. [2024-10-14 07:53:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:53:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-14 07:53:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:53:07,762 INFO L225 Difference]: With dead ends: 313 [2024-10-14 07:53:07,762 INFO L226 Difference]: Without dead ends: 261 [2024-10-14 07:53:07,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-10-14 07:53:07,764 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 117 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:53:07,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 212 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 07:53:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-14 07:53:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 198. [2024-10-14 07:53:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 137 states have (on average 1.2408759124087592) internal successors, (170), 137 states have internal predecessors, (170), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:53:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 266 transitions. [2024-10-14 07:53:07,784 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 266 transitions. Word has length 85 [2024-10-14 07:53:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:53:07,785 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 266 transitions. [2024-10-14 07:53:07,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:53:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 266 transitions. [2024-10-14 07:53:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:53:07,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:53:07,786 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:53:07,793 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 (11)] Ended with exit code 0 [2024-10-14 07:53:07,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-10-14 07:53:08,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 07:53:08,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:53:08,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:53:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1530211333, now seen corresponding path program 1 times [2024-10-14 07:53:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:53:08,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364087549] [2024-10-14 07:53:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:53:08,189 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-14 07:53:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:53:08,190 INFO L229 MonitoredProcess]: Starting monitored process 13 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-14 07:53:08,191 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 (13)] Waiting until timeout for monitored process [2024-10-14 07:53:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:53:08,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 07:53:08,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:53:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 07:53:08,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:53:08,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:53:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364087549] [2024-10-14 07:53:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364087549] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:53:08,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [578848550] [2024-10-14 07:53:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:53:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 07:53:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 07:53:08,885 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 07:53:08,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-14 07:53:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:53:08,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-14 07:53:08,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:53:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:53:11,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:53:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [578848550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:53:11,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:53:11,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-14 07:53:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619672161] [2024-10-14 07:53:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:53:11,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:53:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:53:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:53:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:53:11,432 INFO L87 Difference]: Start difference. First operand 198 states and 266 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:53:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:53:13,005 INFO L93 Difference]: Finished difference Result 352 states and 470 transitions. [2024-10-14 07:53:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:53:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-14 07:53:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:53:13,008 INFO L225 Difference]: With dead ends: 352 [2024-10-14 07:53:13,008 INFO L226 Difference]: Without dead ends: 250 [2024-10-14 07:53:13,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-14 07:53:13,009 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:53:13,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 224 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 07:53:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-14 07:53:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2024-10-14 07:53:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 139 states have (on average 1.2374100719424461) internal successors, (172), 139 states have internal predecessors, (172), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:53:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 268 transitions. [2024-10-14 07:53:13,036 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 268 transitions. Word has length 85 [2024-10-14 07:53:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:53:13,036 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 268 transitions. [2024-10-14 07:53:13,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:53:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 268 transitions. [2024-10-14 07:53:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 07:53:13,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:53:13,037 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:53:13,046 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 (13)] Ended with exit code 0 [2024-10-14 07:53:13,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-10-14 07:53:13,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 07:53:13,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:53:13,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:53:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1882768435, now seen corresponding path program 1 times [2024-10-14 07:53:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:53:13,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284987376] [2024-10-14 07:53:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:53:13,440 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-14 07:53:13,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:53:13,443 INFO L229 MonitoredProcess]: Starting monitored process 15 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-14 07:53:13,444 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 (15)] Waiting until timeout for monitored process [2024-10-14 07:53:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:53:13,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 07:53:13,591 INFO L278 TraceCheckSpWp]: Computing forward predicates...