./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:30:35,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:30:35,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:30:35,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:30:35,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:30:35,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:30:35,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:30:35,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:30:35,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:30:35,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:30:35,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:30:35,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:30:35,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:30:35,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:30:35,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:30:35,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:30:35,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:30:35,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:30:35,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:30:35,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:30:35,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:30:35,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:30:35,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:30:35,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:30:35,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:30:35,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:30:35,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:30:35,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:30:35,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:30:35,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:30:35,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:30:35,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:30:35,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:30:35,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:30:35,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:30:35,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:30:35,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:30:35,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:30:35,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:30:35,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:30:35,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:30:35,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:30:35,657 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-clean/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-clean/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 -> 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f [2024-10-11 10:30:35,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:30:35,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:30:35,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:30:35,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:30:35,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:30:35,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i [2024-10-11 10:30:37,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:30:37,599 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:30:37,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i [2024-10-11 10:30:37,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e8b64b81/1b712b8f834f4f899801cf5cb8357263/FLAGe03e3b257 [2024-10-11 10:30:37,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e8b64b81/1b712b8f834f4f899801cf5cb8357263 [2024-10-11 10:30:37,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:30:37,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:30:37,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:30:37,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:30:37,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:30:37,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:30:37" (1/1) ... [2024-10-11 10:30:37,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2190b6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:37, skipping insertion in model container [2024-10-11 10:30:37,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:30:37" (1/1) ... [2024-10-11 10:30:37,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:30:37,843 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i[913,926] [2024-10-11 10:30:37,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:30:37,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:30:37,947 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i[913,926] [2024-10-11 10:30:37,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:30:38,008 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:30:38,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38 WrapperNode [2024-10-11 10:30:38,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:30:38,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:30:38,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:30:38,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:30:38,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,085 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-10-11 10:30:38,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:30:38,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:30:38,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:30:38,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:30:38,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,123 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:30:38,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:30:38,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:30:38,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:30:38,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:30:38,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (1/1) ... [2024-10-11 10:30:38,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:30:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:30:38,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:30:38,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:30:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:30:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:30:38,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:30:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:30:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:30:38,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:30:38,333 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:30:38,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:30:38,703 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:30:38,704 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:30:38,747 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:30:38,748 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:30:38,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:30:38 BoogieIcfgContainer [2024-10-11 10:30:38,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:30:38,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:30:38,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:30:38,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:30:38,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:30:37" (1/3) ... [2024-10-11 10:30:38,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ba4107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:30:38, skipping insertion in model container [2024-10-11 10:30:38,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:38" (2/3) ... [2024-10-11 10:30:38,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ba4107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:30:38, skipping insertion in model container [2024-10-11 10:30:38,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:30:38" (3/3) ... [2024-10-11 10:30:38,764 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-13.i [2024-10-11 10:30:38,778 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:30:38,778 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:30:38,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:30:38,867 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;@62ea3abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:30:38,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:30:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:30:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 10:30:38,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:30:38,881 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:30:38,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:30:38,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:30:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -758056136, now seen corresponding path program 1 times [2024-10-11 10:30:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:30:38,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58885771] [2024-10-11 10:30:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:30:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:30:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:30:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:30:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:30:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:30:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:30:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:30:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:30:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:30:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:30:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:30:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:30:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:30:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:30:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:30:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:30:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:30:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:30:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:30:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:30:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:30:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:30:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58885771] [2024-10-11 10:30:39,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58885771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:30:39,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:30:39,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:30:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980954210] [2024-10-11 10:30:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:30:39,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:30:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:30:39,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:30:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:30:39,319 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:30:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:30:39,364 INFO L93 Difference]: Finished difference Result 123 states and 212 transitions. [2024-10-11 10:30:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:30:39,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2024-10-11 10:30:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:30:39,375 INFO L225 Difference]: With dead ends: 123 [2024-10-11 10:30:39,375 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 10:30:39,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:30:39,385 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:30:39,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:30:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 10:30:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 10:30:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:30:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2024-10-11 10:30:39,428 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 130 [2024-10-11 10:30:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:30:39,428 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2024-10-11 10:30:39,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:30:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2024-10-11 10:30:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 10:30:39,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:30:39,433 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:30:39,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:30:39,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:30:39,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:30:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1843013424, now seen corresponding path program 1 times [2024-10-11 10:30:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:30:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687773092] [2024-10-11 10:30:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:39,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:30:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:30:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:30:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:30:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:30:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:30:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:30:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:30:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:30:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:30:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:30:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:30:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:30:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:30:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:30:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:30:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:30:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:30:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:30:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:30:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:30:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:30:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:30:39,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687773092] [2024-10-11 10:30:39,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687773092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:30:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:30:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:30:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715965969] [2024-10-11 10:30:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:30:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:30:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:30:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:30:39,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:30:39,709 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:30:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:30:39,791 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2024-10-11 10:30:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:30:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-10-11 10:30:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:30:39,796 INFO L225 Difference]: With dead ends: 153 [2024-10-11 10:30:39,798 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 10:30:39,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:30:39,800 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:30:39,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 198 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:30:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 10:30:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-10-11 10:30:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 62 states have internal predecessors, (80), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 10:30:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-11 10:30:39,832 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 130 [2024-10-11 10:30:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:30:39,833 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-11 10:30:39,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:30:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-11 10:30:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 10:30:39,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:30:39,837 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:30:39,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:30:39,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:30:39,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:30:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash 831896174, now seen corresponding path program 1 times [2024-10-11 10:30:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:30:39,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074665729] [2024-10-11 10:30:39,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:30:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:30:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:30:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:30:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:30:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:30:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:30:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:30:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:30:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:30:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:30:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:30:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:30:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:30:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:30:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:30:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:30:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:30:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:30:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:30:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:30:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:30:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:30:40,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074665729] [2024-10-11 10:30:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074665729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:30:40,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:30:40,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:30:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303149958] [2024-10-11 10:30:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:30:40,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:30:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:30:40,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:30:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:30:40,608 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:30:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:30:41,031 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2024-10-11 10:30:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:30:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-10-11 10:30:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:30:41,037 INFO L225 Difference]: With dead ends: 258 [2024-10-11 10:30:41,037 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 10:30:41,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:30:41,039 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 71 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:30:41,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 313 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:30:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 10:30:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 129. [2024-10-11 10:30:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 80 states have internal predecessors, (99), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 10:30:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2024-10-11 10:30:41,075 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 130 [2024-10-11 10:30:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:30:41,076 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2024-10-11 10:30:41,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:30:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2024-10-11 10:30:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 10:30:41,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:30:41,080 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:30:41,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:30:41,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:30:41,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:30:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1281517925, now seen corresponding path program 1 times [2024-10-11 10:30:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:30:41,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900677542] [2024-10-11 10:30:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:30:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:30:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:30:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:30:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:30:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:30:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:30:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:30:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:30:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:30:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:30:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:30:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:30:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:30:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:30:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:30:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:30:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:30:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:30:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:30:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:30:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:30:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:30:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900677542] [2024-10-11 10:30:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900677542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:30:41,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:30:41,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:30:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748283289] [2024-10-11 10:30:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:30:41,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:30:41,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:30:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:30:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:30:41,364 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:30:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:30:41,546 INFO L93 Difference]: Finished difference Result 255 states and 374 transitions. [2024-10-11 10:30:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:30:41,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-10-11 10:30:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:30:41,553 INFO L225 Difference]: With dead ends: 255 [2024-10-11 10:30:41,553 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 10:30:41,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:30:41,558 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 104 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:30:41,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:30:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 10:30:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2024-10-11 10:30:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 84 states have (on average 1.25) internal successors, (105), 85 states have internal predecessors, (105), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 10:30:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2024-10-11 10:30:41,590 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 131 [2024-10-11 10:30:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:30:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2024-10-11 10:30:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:30:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2024-10-11 10:30:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 10:30:41,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:30:41,594 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:30:41,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:30:41,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:30:41,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:30:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1023352487, now seen corresponding path program 1 times [2024-10-11 10:30:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:30:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305633924] [2024-10-11 10:30:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:30:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:30:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498022740] [2024-10-11 10:30:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:30:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:30:41,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:30:41,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:30:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:30:41,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:30:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:30:42,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:30:42,099 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:30:42,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:30:42,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:30:42,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:30:42,307 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 10:30:42,421 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:30:42,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:30:42 BoogieIcfgContainer [2024-10-11 10:30:42,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:30:42,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:30:42,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:30:42,429 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:30:42,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:30:38" (3/4) ... [2024-10-11 10:30:42,432 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:30:42,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:30:42,434 INFO L158 Benchmark]: Toolchain (without parser) took 4802.03ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 156.2MB in the beginning and 97.8MB in the end (delta: 58.5MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-10-11 10:30:42,435 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:30:42,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.07ms. Allocated memory is still 186.6MB. Free memory was 155.4MB in the beginning and 140.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:30:42,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.81ms. Allocated memory is still 186.6MB. Free memory was 139.7MB in the beginning and 136.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:30:42,436 INFO L158 Benchmark]: Boogie Preprocessor took 62.30ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 131.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:30:42,437 INFO L158 Benchmark]: RCFGBuilder took 598.83ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 137.5MB in the end (delta: -6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 10:30:42,437 INFO L158 Benchmark]: TraceAbstraction took 3674.95ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 136.4MB in the beginning and 97.8MB in the end (delta: 38.7MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2024-10-11 10:30:42,437 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 224.4MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:30:42,442 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.16ms. Allocated memory is still 115.3MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.07ms. Allocated memory is still 186.6MB. Free memory was 155.4MB in the beginning and 140.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.81ms. Allocated memory is still 186.6MB. Free memory was 139.7MB in the beginning and 136.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.30ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 131.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 598.83ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 137.5MB in the end (delta: -6.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3674.95ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 136.4MB in the beginning and 97.8MB in the end (delta: 38.7MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 224.4MB. Free memory is still 97.8MB. 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 127, overapproximation of shiftRight at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] signed short int last_1_var_1_21 = -64; [L43] unsigned char last_1_var_1_22 = 25; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L123] last_1_var_1_21 = var_1_21 [L124] last_1_var_1_22 = var_1_22 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L89] var_1_4 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L95] var_1_6 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L98] var_1_9 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L99] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L100] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L101] var_1_10 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L104] var_1_11 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L106] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L107] var_1_13 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L110] var_1_14 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L113] var_1_17 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L115] var_1_18 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L117] var_1_19 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L119] var_1_20 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L135] RET updateVariables() [L136] CALL step() [L47] signed long int stepLocal_1 = ~ last_1_var_1_21; [L48] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L49] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L49] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L50] COND TRUE stepLocal_0 || var_1_6 [L51] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L61] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L62] COND FALSE !(var_1_4 > stepLocal_3) [L65] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L67] COND TRUE ((- var_1_11) < 8) || var_1_9 [L68] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=0, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L70] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L71] COND TRUE var_1_18 <= var_1_20 [L72] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L78] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L83] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=127, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L84] COND TRUE var_1_10 > stepLocal_2 [L85] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L127-L128] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 738 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 383 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 355 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 75 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 1544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:30:42,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:30:44,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:30:44,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:30:44,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:30:44,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:30:44,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:30:44,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:30:44,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:30:44,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:30:44,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:30:44,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:30:44,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:30:44,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:30:44,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:30:44,708 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:30:44,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:30:44,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:30:44,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:30:44,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:30:44,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:30:44,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:30:44,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:30:44,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:30:44,712 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:30:44,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:30:44,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:30:44,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:30:44,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:30:44,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:30:44,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:30:44,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:30:44,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:30:44,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:30:44,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:30:44,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:30:44,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:30:44,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:30:44,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:30:44,717 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:30:44,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:30:44,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:30:44,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:30:44,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:30:44,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:30:44,721 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:30:44,722 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-clean/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-clean/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 -> 4f1bba3d9f281d4d8bc08bca7bbe0ca52659ab0a02494d574b1e97e91dfbc45f [2024-10-11 10:30:45,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:30:45,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:30:45,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:30:45,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:30:45,067 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:30:45,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i [2024-10-11 10:30:46,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:30:46,738 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:30:46,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i [2024-10-11 10:30:46,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8603485f/ee40c06977754259a1d8fbfa1d99edcc/FLAG92047d359 [2024-10-11 10:30:46,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8603485f/ee40c06977754259a1d8fbfa1d99edcc [2024-10-11 10:30:46,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:30:46,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:30:46,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:30:46,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:30:46,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:30:46,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:30:46" (1/1) ... [2024-10-11 10:30:46,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd5754d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:46, skipping insertion in model container [2024-10-11 10:30:46,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:30:46" (1/1) ... [2024-10-11 10:30:46,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:30:47,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i[913,926] [2024-10-11 10:30:47,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:30:47,108 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:30:47,119 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-13.i[913,926] [2024-10-11 10:30:47,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:30:47,179 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:30:47,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47 WrapperNode [2024-10-11 10:30:47,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:30:47,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:30:47,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:30:47,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:30:47,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,226 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-11 10:30:47,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:30:47,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:30:47,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:30:47,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:30:47,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:30:47,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:30:47,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:30:47,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:30:47,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:30:47,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (1/1) ... [2024-10-11 10:30:47,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:30:47,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:30:47,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:30:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:30:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:30:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:30:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:30:47,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:30:47,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:30:47,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:30:47,468 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:30:47,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:30:50,623 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:30:50,623 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:30:50,676 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:30:50,676 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:30:50,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:30:50 BoogieIcfgContainer [2024-10-11 10:30:50,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:30:50,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:30:50,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:30:50,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:30:50,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:30:46" (1/3) ... [2024-10-11 10:30:50,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e969428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:30:50, skipping insertion in model container [2024-10-11 10:30:50,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:30:47" (2/3) ... [2024-10-11 10:30:50,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e969428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:30:50, skipping insertion in model container [2024-10-11 10:30:50,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:30:50" (3/3) ... [2024-10-11 10:30:50,688 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-13.i [2024-10-11 10:30:50,704 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:30:50,704 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:30:50,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:30:50,784 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;@1ae68c6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:30:50,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:30:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:30:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 10:30:50,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:30:50,803 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:30:50,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:30:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:30:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1314693591, now seen corresponding path program 1 times [2024-10-11 10:30:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:30:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228629492] [2024-10-11 10:30:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:50,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:30:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:30:50,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:30:50,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:30:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:51,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:30:51,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:30:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-10-11 10:30:51,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:30:51,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:30:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228629492] [2024-10-11 10:30:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228629492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:30:51,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:30:51,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:30:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082061969] [2024-10-11 10:30:51,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:30:51,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:30:51,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:30:51,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:30:51,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:30:51,313 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:30:53,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:30:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:30:53,385 INFO L93 Difference]: Finished difference Result 113 states and 198 transitions. [2024-10-11 10:30:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:30:53,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-10-11 10:30:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:30:53,415 INFO L225 Difference]: With dead ends: 113 [2024-10-11 10:30:53,416 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 10:30:53,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:30:53,421 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:30:53,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 10:30:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 10:30:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 10:30:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:30:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-10-11 10:30:53,462 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 127 [2024-10-11 10:30:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:30:53,462 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-10-11 10:30:53,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:30:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-10-11 10:30:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 10:30:53,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:30:53,465 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:30:53,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:30:53,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:30:53,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:30:53,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:30:53,667 INFO L85 PathProgramCache]: Analyzing trace with hash -278152993, now seen corresponding path program 1 times [2024-10-11 10:30:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:30:53,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525755933] [2024-10-11 10:30:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:30:53,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:30:53,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:30:53,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:30:53,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:30:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:30:53,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:30:53,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:30:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:30:55,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:30:55,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:30:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525755933] [2024-10-11 10:30:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525755933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:30:55,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:30:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:30:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146661518] [2024-10-11 10:30:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:30:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:30:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:30:55,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:30:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:30:55,385 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:30:58,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:31:00,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:31:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:31:00,453 INFO L93 Difference]: Finished difference Result 167 states and 251 transitions. [2024-10-11 10:31:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:31:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-11 10:31:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:31:00,478 INFO L225 Difference]: With dead ends: 167 [2024-10-11 10:31:00,478 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 10:31:00,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:31:00,480 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 51 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:31:00,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 269 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 10:31:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 10:31:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2024-10-11 10:31:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:31:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2024-10-11 10:31:00,539 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 127 [2024-10-11 10:31:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:31:00,540 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2024-10-11 10:31:00,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:31:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2024-10-11 10:31:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 10:31:00,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:31:00,547 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:31:00,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:31:00,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:31:00,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:31:00,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:31:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1372605735, now seen corresponding path program 1 times [2024-10-11 10:31:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:31:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806376349] [2024-10-11 10:31:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:31:00,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:31:00,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:31:00,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:31:00,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:31:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:31:01,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:31:01,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:31:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:31:02,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:31:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:31:02,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:31:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806376349] [2024-10-11 10:31:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806376349] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 10:31:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:31:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-11 10:31:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073803517] [2024-10-11 10:31:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:31:02,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:31:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:31:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:31:02,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:31:02,317 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:31:05,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:31:07,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:31:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:31:07,680 INFO L93 Difference]: Finished difference Result 166 states and 248 transitions. [2024-10-11 10:31:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:31:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-10-11 10:31:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:31:07,684 INFO L225 Difference]: With dead ends: 166 [2024-10-11 10:31:07,684 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 10:31:07,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:31:07,690 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:31:07,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 208 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 10:31:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 10:31:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-10-11 10:31:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:31:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-10-11 10:31:07,723 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 128 [2024-10-11 10:31:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:31:07,726 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-10-11 10:31:07,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:31:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-10-11 10:31:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 10:31:07,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:31:07,729 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:31:07,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:31:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:31:07,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:31:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:31:07,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1765632745, now seen corresponding path program 1 times [2024-10-11 10:31:07,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:31:07,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587440054] [2024-10-11 10:31:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:31:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:31:07,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:31:07,938 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:31:07,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:31:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:31:08,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 10:31:08,250 INFO L278 TraceCheckSpWp]: Computing forward predicates...