./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.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 db4339d9c0024596d658d0411cbe4cbce1656ab1dc5134de3a6a8a906120bfe4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:24:49,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:24:49,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:24:49,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:24:49,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:24:49,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:24:49,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:24:49,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:24:49,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:24:49,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:24:49,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:24:49,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:24:49,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:24:49,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:24:49,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:24:49,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:24:49,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:24:49,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:24:49,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:24:49,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:24:49,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:24:49,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:24:49,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:24:49,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:24:49,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:24:49,254 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:24:49,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:24:49,254 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:24:49,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:24:49,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:24:49,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:24:49,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:24:49,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:24:49,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:24:49,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:24:49,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:24:49,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:24:49,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:24:49,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:24:49,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:24:49,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:24:49,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:24:49,258 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 -> db4339d9c0024596d658d0411cbe4cbce1656ab1dc5134de3a6a8a906120bfe4 [2024-11-16 15:24:49,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:24:49,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:24:49,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:24:49,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:24:49,480 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:24:49,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i [2024-11-16 15:24:50,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:24:50,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:24:50,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i [2024-11-16 15:24:50,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68d720f1/52fd200352b243959b0417f78b163cc1/FLAGa06d2b390 [2024-11-16 15:24:51,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68d720f1/52fd200352b243959b0417f78b163cc1 [2024-11-16 15:24:51,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:24:51,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:24:51,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:24:51,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:24:51,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:24:51,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650f7fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51, skipping insertion in model container [2024-11-16 15:24:51,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:24:51,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i[913,926] [2024-11-16 15:24:51,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:24:51,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:24:51,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i[913,926] [2024-11-16 15:24:51,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:24:51,611 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:24:51,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51 WrapperNode [2024-11-16 15:24:51,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:24:51,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:24:51,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:24:51,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:24:51,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,699 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2024-11-16 15:24:51,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:24:51,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:24:51,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:24:51,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:24:51,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,725 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:24:51,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:24:51,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:24:51,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:24:51,742 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:24:51,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (1/1) ... [2024-11-16 15:24:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:24:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:24:51,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:24:51,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:24:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:24:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:24:51,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:24:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:24:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:24:51,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:24:51,881 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:24:51,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:24:52,163 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~ite17#1;havoc property_#t~ite16#1;havoc property_#t~bitwise15#1;havoc property_#t~short18#1; [2024-11-16 15:24:52,192 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 15:24:52,192 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:24:52,219 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:24:52,219 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:24:52,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:24:52 BoogieIcfgContainer [2024-11-16 15:24:52,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:24:52,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:24:52,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:24:52,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:24:52,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:24:51" (1/3) ... [2024-11-16 15:24:52,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12aa78c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:24:52, skipping insertion in model container [2024-11-16 15:24:52,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:24:51" (2/3) ... [2024-11-16 15:24:52,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12aa78c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:24:52, skipping insertion in model container [2024-11-16 15:24:52,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:24:52" (3/3) ... [2024-11-16 15:24:52,227 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-17.i [2024-11-16 15:24:52,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:24:52,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:24:52,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:24:52,310 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;@3512bc80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:24:52,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:24:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:24:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 15:24:52,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:24:52,328 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:24:52,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:24:52,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:24:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -922413792, now seen corresponding path program 1 times [2024-11-16 15:24:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:24:52,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881214117] [2024-11-16 15:24:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:24:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:24:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:24:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:24:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:24:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:24:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:24:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:24:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:24:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:24:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:24:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:24:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:24:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:24:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:24:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:24:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:24:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:24:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:24:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:24:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:24:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:24:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881214117] [2024-11-16 15:24:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881214117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:24:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:24:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:24:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290753631] [2024-11-16 15:24:52,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:24:52,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:24:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:24:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:24:52,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:24:52,706 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:24:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:24:52,737 INFO L93 Difference]: Finished difference Result 146 states and 239 transitions. [2024-11-16 15:24:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:24:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-16 15:24:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:24:52,748 INFO L225 Difference]: With dead ends: 146 [2024-11-16 15:24:52,749 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 15:24:52,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:24:52,755 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:24:52,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:24:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 15:24:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-16 15:24:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:24:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2024-11-16 15:24:52,791 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 124 [2024-11-16 15:24:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:24:52,792 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2024-11-16 15:24:52,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:24:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2024-11-16 15:24:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 15:24:52,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:24:52,797 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:24:52,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:24:52,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:24:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:24:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1330924386, now seen corresponding path program 1 times [2024-11-16 15:24:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:24:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084596887] [2024-11-16 15:24:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:24:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:24:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:24:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:24:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:24:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:24:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:24:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:24:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:24:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:24:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:24:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:24:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:24:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:24:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:24:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:24:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:24:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:24:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:24:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:24:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:24:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:24:53,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084596887] [2024-11-16 15:24:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084596887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:24:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:24:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:24:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530270210] [2024-11-16 15:24:53,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:24:53,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:24:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:24:53,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:24:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:24:53,357 INFO L87 Difference]: Start difference. First operand 72 states and 106 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:24:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:24:53,567 INFO L93 Difference]: Finished difference Result 212 states and 314 transitions. [2024-11-16 15:24:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:24:53,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-16 15:24:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:24:53,571 INFO L225 Difference]: With dead ends: 212 [2024-11-16 15:24:53,572 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 15:24:53,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:24:53,574 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 74 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:24:53,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 343 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:24:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 15:24:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2024-11-16 15:24:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 15:24:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-16 15:24:53,610 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 124 [2024-11-16 15:24:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:24:53,613 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-16 15:24:53,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:24:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-16 15:24:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 15:24:53,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:24:53,615 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:24:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:24:53,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:24:53,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:24:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1276118396, now seen corresponding path program 1 times [2024-11-16 15:24:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:24:53,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243820573] [2024-11-16 15:24:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:24:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:24:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:24:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:24:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:24:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:24:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:24:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:24:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:24:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:24:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:24:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:24:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:24:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:24:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:24:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:24:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:24:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:24:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:24:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:24:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 15:24:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:24:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243820573] [2024-11-16 15:24:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243820573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:24:54,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196404397] [2024-11-16 15:24:54,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:24:54,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:24:54,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:24:54,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:24:54,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:24:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:24:54,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 15:24:54,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:24:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 317 proven. 21 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-16 15:24:54,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:24:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 15:24:54,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196404397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:24:54,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:24:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2024-11-16 15:24:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596218664] [2024-11-16 15:24:54,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:24:54,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 15:24:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:24:54,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 15:24:54,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-16 15:24:54,851 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2024-11-16 15:24:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:24:55,466 INFO L93 Difference]: Finished difference Result 340 states and 484 transitions. [2024-11-16 15:24:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 15:24:55,467 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 125 [2024-11-16 15:24:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:24:55,469 INFO L225 Difference]: With dead ends: 340 [2024-11-16 15:24:55,469 INFO L226 Difference]: Without dead ends: 271 [2024-11-16 15:24:55,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2024-11-16 15:24:55,471 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 521 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:24:55,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 610 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:24:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-16 15:24:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 173. [2024-11-16 15:24:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 113 states have internal predecessors, (134), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 15:24:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2024-11-16 15:24:55,490 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 125 [2024-11-16 15:24:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:24:55,490 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2024-11-16 15:24:55,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2024-11-16 15:24:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2024-11-16 15:24:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 15:24:55,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:24:55,492 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:24:55,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 15:24:55,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:24:55,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:24:55,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:24:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1569521403, now seen corresponding path program 1 times [2024-11-16 15:24:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:24:55,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496743184] [2024-11-16 15:24:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:24:55,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:24:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:24:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812267691] [2024-11-16 15:24:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:24:55,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:24:55,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:24:55,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:24:55,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 15:24:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:24:55,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:24:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:24:55,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:24:55,908 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:24:55,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:24:55,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 15:24:56,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-16 15:24:56,113 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 15:24:56,171 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:24:56,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:24:56 BoogieIcfgContainer [2024-11-16 15:24:56,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:24:56,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:24:56,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:24:56,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:24:56,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:24:52" (3/4) ... [2024-11-16 15:24:56,179 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:24:56,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:24:56,184 INFO L158 Benchmark]: Toolchain (without parser) took 4905.01ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 98.4MB in the beginning and 109.9MB in the end (delta: -11.5MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2024-11-16 15:24:56,184 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 126.3MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:24:56,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.59ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 140.1MB in the end (delta: -41.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-16 15:24:56,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.78ms. Allocated memory is still 167.8MB. Free memory was 140.1MB in the beginning and 136.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:24:56,185 INFO L158 Benchmark]: Boogie Preprocessor took 40.68ms. Allocated memory is still 167.8MB. Free memory was 136.0MB in the beginning and 131.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 15:24:56,185 INFO L158 Benchmark]: IcfgBuilder took 477.80ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 105.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 15:24:56,186 INFO L158 Benchmark]: TraceAbstraction took 3956.16ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 105.2MB in the beginning and 109.9MB in the end (delta: -4.7MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-11-16 15:24:56,186 INFO L158 Benchmark]: Witness Printer took 6.59ms. Allocated memory is still 239.1MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:24:56,187 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.18ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 126.3MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.59ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 140.1MB in the end (delta: -41.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.78ms. Allocated memory is still 167.8MB. Free memory was 140.1MB in the beginning and 136.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.68ms. Allocated memory is still 167.8MB. Free memory was 136.0MB in the beginning and 131.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 477.80ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 105.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3956.16ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 105.2MB in the beginning and 109.9MB in the end (delta: -4.7MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * Witness Printer took 6.59ms. Allocated memory is still 239.1MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] unsigned char last_1_var_1_8 = 1; [L40] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] last_1_var_1_8 = var_1_8 [L118] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L128] RET updateLastVariables() [L129] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=0, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L99] var_1_9 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L101] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L102] var_1_10 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L105] var_1_12 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L107] var_1_13 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L110] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L111] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L112] var_1_19 = __VERIFIER_nondet_ulong() [L113] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L129] RET updateVariables() [L130] CALL step() [L44] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L45] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L46] COND TRUE \read(last_1_var_1_8) [L47] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L52] COND TRUE var_1_5 < var_1_3 [L53] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L57] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L58] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L63] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L64] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L65] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L69] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L70] COND TRUE var_1_4 == stepLocal_1 [L71] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L73] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L73] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L74] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L121-L122] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483639, var_1_19=2147483647, var_1_1=57, var_1_2=8, var_1_3=-504, var_1_4=7, var_1_5=-6, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 1057 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 775 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 759 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 282 mSDtfsCounter, 759 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 132 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 4 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2997/3060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 15:24:56,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.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 db4339d9c0024596d658d0411cbe4cbce1656ab1dc5134de3a6a8a906120bfe4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:24:58,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:24:58,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:24:58,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:24:58,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:24:58,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:24:58,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:24:58,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:24:58,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:24:58,328 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:24:58,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:24:58,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:24:58,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:24:58,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:24:58,330 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:24:58,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:24:58,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:24:58,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:24:58,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:24:58,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:24:58,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:24:58,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:24:58,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:24:58,335 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:24:58,335 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:24:58,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:24:58,335 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:24:58,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:24:58,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:24:58,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:24:58,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:24:58,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:24:58,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:24:58,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:24:58,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:24:58,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:24:58,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:24:58,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:24:58,338 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:24:58,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:24:58,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:24:58,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:24:58,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:24:58,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:24:58,342 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 -> db4339d9c0024596d658d0411cbe4cbce1656ab1dc5134de3a6a8a906120bfe4 [2024-11-16 15:24:58,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:24:58,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:24:58,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:24:58,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:24:58,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:24:58,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i [2024-11-16 15:25:00,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:25:00,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:25:00,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i [2024-11-16 15:25:00,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2393adbd5/d4bd1303b5884cc0adbecf9874d2aa66/FLAGc8b1a2503 [2024-11-16 15:25:00,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2393adbd5/d4bd1303b5884cc0adbecf9874d2aa66 [2024-11-16 15:25:00,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:25:00,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:25:00,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:25:00,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:25:00,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:25:00,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:00,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d4f6d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00, skipping insertion in model container [2024-11-16 15:25:00,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:00,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:25:00,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i[913,926] [2024-11-16 15:25:00,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:25:00,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:25:00,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-17.i[913,926] [2024-11-16 15:25:00,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:25:00,942 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:25:00,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00 WrapperNode [2024-11-16 15:25:00,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:25:00,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:25:00,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:25:00,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:25:00,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:00,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:00,994 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-16 15:25:00,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:25:00,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:25:00,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:25:00,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:25:01,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,034 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:25:01,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:25:01,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:25:01,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:25:01,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:25:01,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (1/1) ... [2024-11-16 15:25:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:25:01,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:25:01,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:25:01,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:25:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:25:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:25:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:25:01,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:25:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:25:01,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:25:01,214 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:25:01,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:25:01,825 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 15:25:01,825 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:25:01,838 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:25:01,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:25:01,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:25:01 BoogieIcfgContainer [2024-11-16 15:25:01,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:25:01,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:25:01,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:25:01,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:25:01,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:25:00" (1/3) ... [2024-11-16 15:25:01,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4718e337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:25:01, skipping insertion in model container [2024-11-16 15:25:01,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:25:00" (2/3) ... [2024-11-16 15:25:01,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4718e337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:25:01, skipping insertion in model container [2024-11-16 15:25:01,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:25:01" (3/3) ... [2024-11-16 15:25:01,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-17.i [2024-11-16 15:25:01,868 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:25:01,868 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:25:01,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:25:01,920 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;@617079d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:25:01,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:25:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:25:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 15:25:01,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:25:01,935 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:25:01,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:25:01,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:25:01,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1233933773, now seen corresponding path program 1 times [2024-11-16 15:25:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:25:01,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066505596] [2024-11-16 15:25:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:25:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:25:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:25:01,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:25:01,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 15:25:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:25:02,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:25:02,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:25:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-16 15:25:02,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:25:02,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:25:02,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066505596] [2024-11-16 15:25:02,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066505596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:25:02,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:25:02,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:25:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907770711] [2024-11-16 15:25:02,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:25:02,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:25:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:25:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:25:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:25:02,223 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:25:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:25:02,242 INFO L93 Difference]: Finished difference Result 120 states and 199 transitions. [2024-11-16 15:25:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:25:02,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2024-11-16 15:25:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:25:02,248 INFO L225 Difference]: With dead ends: 120 [2024-11-16 15:25:02,248 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 15:25:02,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:25:02,252 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:25:02,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:25:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 15:25:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-16 15:25:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:25:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-16 15:25:02,286 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 121 [2024-11-16 15:25:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:25:02,287 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-16 15:25:02,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:25:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-16 15:25:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 15:25:02,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:25:02,290 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:25:02,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 15:25:02,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:25:02,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:25:02,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:25:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash 29846389, now seen corresponding path program 1 times [2024-11-16 15:25:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:25:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504758846] [2024-11-16 15:25:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:25:02,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:25:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:25:02,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:25:02,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 15:25:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:25:02,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 15:25:02,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:25:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:25:02,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:25:02,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:25:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504758846] [2024-11-16 15:25:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504758846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:25:02,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:25:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:25:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657399627] [2024-11-16 15:25:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:25:02,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:25:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:25:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:25:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:25:02,940 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:25:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:25:03,399 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-11-16 15:25:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:25:03,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-16 15:25:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:25:03,409 INFO L225 Difference]: With dead ends: 173 [2024-11-16 15:25:03,409 INFO L226 Difference]: Without dead ends: 117 [2024-11-16 15:25:03,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:25:03,411 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 50 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:25:03,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 272 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:25:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-16 15:25:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2024-11-16 15:25:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 15:25:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2024-11-16 15:25:03,426 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 121 [2024-11-16 15:25:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:25:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2024-11-16 15:25:03,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:25:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2024-11-16 15:25:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 15:25:03,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:25:03,428 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:25:03,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 15:25:03,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:25:03,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:25:03,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:25:03,630 INFO L85 PathProgramCache]: Analyzing trace with hash -433083506, now seen corresponding path program 1 times [2024-11-16 15:25:03,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:25:03,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171971572] [2024-11-16 15:25:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:25:03,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:25:03,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:25:03,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:25:03,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 15:25:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:25:03,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 15:25:03,772 INFO L278 TraceCheckSpWp]: Computing forward predicates...