./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_filler-ps-ci_file-70.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_filler-ps-ci_file-70.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 b07a4b583601a48b942e5bdbd136c020a0a60c7f6ea7655680550275607bd971 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:04:44,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:04:44,178 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:04:44,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:04:44,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:04:44,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:04:44,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:04:44,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:04:44,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:04:44,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:04:44,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:04:44,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:04:44,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:04:44,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:04:44,211 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:04:44,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:04:44,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:04:44,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:04:44,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:04:44,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:04:44,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:04:44,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:04:44,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:04:44,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:04:44,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:04:44,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:04:44,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:04:44,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:04:44,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:04:44,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:04:44,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:04:44,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:04:44,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:44,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:04:44,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:04:44,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:04:44,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:04:44,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:04:44,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:04:44,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:04:44,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:04:44,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:04:44,222 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 -> b07a4b583601a48b942e5bdbd136c020a0a60c7f6ea7655680550275607bd971 [2024-10-11 10:04:44,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:04:44,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:04:44,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:04:44,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:04:44,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:04:44,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-70.i [2024-10-11 10:04:45,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:04:45,879 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:04:45,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-70.i [2024-10-11 10:04:45,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b41c3e992/1a0878960ee2441a946c32184d39297e/FLAG8ff04eabc [2024-10-11 10:04:45,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b41c3e992/1a0878960ee2441a946c32184d39297e [2024-10-11 10:04:45,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:04:45,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:04:45,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:45,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:04:45,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:04:45,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:45" (1/1) ... [2024-10-11 10:04:45,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fb110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:45, skipping insertion in model container [2024-10-11 10:04:45,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:45" (1/1) ... [2024-10-11 10:04:45,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:04:46,094 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_filler-ps-ci_file-70.i[919,932] [2024-10-11 10:04:46,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:46,160 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:04:46,169 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_filler-ps-ci_file-70.i[919,932] [2024-10-11 10:04:46,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:46,201 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:04:46,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46 WrapperNode [2024-10-11 10:04:46,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:46,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:46,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:04:46,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:04:46,207 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:04:46" (1/1) ... [2024-10-11 10:04:46,215 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:04:46" (1/1) ... [2024-10-11 10:04:46,246 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-11 10:04:46,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:46,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:04:46,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:04:46,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:04:46,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,279 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:04:46,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:04:46,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:04:46,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:04:46,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:04:46,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:46,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:04:46,329 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:04:46,331 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:04:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:04:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:04:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:04:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:04:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:04:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:04:46,423 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:04:46,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:04:46,693 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 10:04:46,693 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:04:46,740 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:04:46,740 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:04:46,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:46 BoogieIcfgContainer [2024-10-11 10:04:46,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:04:46,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:04:46,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:04:46,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:04:46,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:04:45" (1/3) ... [2024-10-11 10:04:46,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2966be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:46, skipping insertion in model container [2024-10-11 10:04:46,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (2/3) ... [2024-10-11 10:04:46,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2966be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:46, skipping insertion in model container [2024-10-11 10:04:46,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:46" (3/3) ... [2024-10-11 10:04:46,748 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-70.i [2024-10-11 10:04:46,760 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:04:46,761 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:04:46,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:04:46,814 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;@557d589e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:04:46,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:04:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 45 states have (on average 1.6) internal successors, (72), 46 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 10:04:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 10:04:46,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:46,831 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash -34456954, now seen corresponding path program 1 times [2024-10-11 10:04:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:46,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745563506] [2024-10-11 10:04:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 10:04:47,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:47,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745563506] [2024-10-11 10:04:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745563506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:47,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:47,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:04:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516123898] [2024-10-11 10:04:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:04:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:47,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:04:47,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:04:47,221 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.6) internal successors, (72), 46 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 10:04:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:47,257 INFO L93 Difference]: Finished difference Result 123 states and 217 transitions. [2024-10-11 10:04:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:04:47,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2024-10-11 10:04:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:47,283 INFO L225 Difference]: With dead ends: 123 [2024-10-11 10:04:47,283 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 10:04:47,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:04:47,290 INFO L432 NwaCegarLoop]: 93 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, 93 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:04:47,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:04:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 10:04:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 10:04:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 10:04:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2024-10-11 10:04:47,346 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 103 [2024-10-11 10:04:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:47,346 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2024-10-11 10:04:47,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 10:04:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2024-10-11 10:04:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 10:04:47,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:47,350 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:47,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:04:47,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash 511421836, now seen corresponding path program 1 times [2024-10-11 10:04:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:47,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456542041] [2024-10-11 10:04:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 10:04:48,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:48,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456542041] [2024-10-11 10:04:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456542041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:04:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763983102] [2024-10-11 10:04:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:04:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:04:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:04:48,329 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 10:04:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:48,441 INFO L93 Difference]: Finished difference Result 168 states and 267 transitions. [2024-10-11 10:04:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:04:48,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-11 10:04:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:48,443 INFO L225 Difference]: With dead ends: 168 [2024-10-11 10:04:48,445 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 10:04:48,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:04:48,446 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:48,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 141 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:04:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 10:04:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2024-10-11 10:04:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:04:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-10-11 10:04:48,472 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 103 [2024-10-11 10:04:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:48,473 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-10-11 10:04:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 10:04:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-10-11 10:04:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 10:04:48,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:48,477 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:48,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:04:48,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:48,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1076926066, now seen corresponding path program 1 times [2024-10-11 10:04:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134676006] [2024-10-11 10:04:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 10:04:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:48,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134676006] [2024-10-11 10:04:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134676006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:04:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657268075] [2024-10-11 10:04:48,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:48,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:04:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:04:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:04:48,710 INFO L87 Difference]: Start difference. First operand 91 states and 140 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 10:04:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:48,851 INFO L93 Difference]: Finished difference Result 253 states and 384 transitions. [2024-10-11 10:04:48,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:04:48,851 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-11 10:04:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:48,856 INFO L225 Difference]: With dead ends: 253 [2024-10-11 10:04:48,856 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 10:04:48,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:04:48,859 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:48,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 287 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:04:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 10:04:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2024-10-11 10:04:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.3828125) internal successors, (177), 130 states have internal predecessors, (177), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 10:04:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 279 transitions. [2024-10-11 10:04:48,894 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 279 transitions. Word has length 103 [2024-10-11 10:04:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:48,895 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 279 transitions. [2024-10-11 10:04:48,895 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 10:04:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 279 transitions. [2024-10-11 10:04:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 10:04:48,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:48,901 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:48,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:04:48,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:48,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1076866484, now seen corresponding path program 1 times [2024-10-11 10:04:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:48,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010843265] [2024-10-11 10:04:48,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:48,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 10:04:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010843265] [2024-10-11 10:04:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010843265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:04:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634162759] [2024-10-11 10:04:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:49,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:04:49,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:04:49,193 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:04:49,195 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:04:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:04:49,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:04:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-11 10:04:49,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:04:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 10:04:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634162759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:04:49,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:04:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 10:04:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167429330] [2024-10-11 10:04:49,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:04:49,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:04:49,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:49,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:04:49,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:04:49,615 INFO L87 Difference]: Start difference. First operand 185 states and 279 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 10:04:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:49,755 INFO L93 Difference]: Finished difference Result 313 states and 467 transitions. [2024-10-11 10:04:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:04:49,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 103 [2024-10-11 10:04:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:49,757 INFO L225 Difference]: With dead ends: 313 [2024-10-11 10:04:49,757 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 10:04:49,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:04:49,761 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 51 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:49,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:04:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 10:04:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-10-11 10:04:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 45 states have call successors, (45), 6 states have call predecessors, (45), 6 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 10:04:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2024-10-11 10:04:49,781 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 103 [2024-10-11 10:04:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:49,782 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2024-10-11 10:04:49,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 10:04:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2024-10-11 10:04:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 10:04:49,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:49,783 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:49,798 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:04:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:04:49,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:49,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2084803356, now seen corresponding path program 1 times [2024-10-11 10:04:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500676632] [2024-10-11 10:04:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:04:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161718315] [2024-10-11 10:04:50,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:50,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:04:50,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:04:50,095 INFO L229 MonitoredProcess]: Starting monitored process 3 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:04:50,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:04:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:04:50,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:04:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:04:50,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:04:50,690 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:04:50,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:04:50,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:04:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:04:50,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 10:04:50,973 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:04:50,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:04:50 BoogieIcfgContainer [2024-10-11 10:04:50,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:04:50,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:04:50,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:04:50,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:04:50,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:46" (3/4) ... [2024-10-11 10:04:50,979 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:04:50,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:04:50,980 INFO L158 Benchmark]: Toolchain (without parser) took 5075.52ms. Allocated memory was 134.2MB in the beginning and 241.2MB in the end (delta: 107.0MB). Free memory was 64.0MB in the beginning and 182.8MB in the end (delta: -118.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:04:50,981 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:04:50,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.71ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 63.8MB in the beginning and 157.9MB in the end (delta: -94.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-11 10:04:50,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.36ms. Allocated memory is still 195.0MB. Free memory was 157.9MB in the beginning and 153.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:04:50,981 INFO L158 Benchmark]: Boogie Preprocessor took 48.86ms. Allocated memory is still 195.0MB. Free memory was 153.7MB in the beginning and 147.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:04:50,982 INFO L158 Benchmark]: RCFGBuilder took 444.48ms. Allocated memory is still 195.0MB. Free memory was 147.4MB in the beginning and 114.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 10:04:50,982 INFO L158 Benchmark]: TraceAbstraction took 4232.68ms. Allocated memory was 195.0MB in the beginning and 241.2MB in the end (delta: 46.1MB). Free memory was 113.9MB in the beginning and 183.8MB in the end (delta: -69.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:04:50,982 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 241.2MB. Free memory was 183.8MB in the beginning and 182.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:04:50,983 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.15ms. Allocated memory is still 134.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.71ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 63.8MB in the beginning and 157.9MB in the end (delta: -94.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.36ms. Allocated memory is still 195.0MB. Free memory was 157.9MB in the beginning and 153.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.86ms. Allocated memory is still 195.0MB. Free memory was 153.7MB in the beginning and 147.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 444.48ms. Allocated memory is still 195.0MB. Free memory was 147.4MB in the beginning and 114.9MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4232.68ms. Allocated memory was 195.0MB in the beginning and 241.2MB in the end (delta: 46.1MB). Free memory was 113.9MB in the beginning and 183.8MB in the end (delta: -69.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 241.2MB. Free memory was 183.8MB in the beginning and 182.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_31 = 1; [L40] unsigned long int var_1_33 = 2; [L41] unsigned short int var_1_34 = 0; [L42] signed short int var_1_35 = -10; [L43] unsigned char var_1_40 = 2; [L44] unsigned short int var_1_42 = 8; [L45] unsigned long int var_1_44 = 1249494912; [L46] double last_1_var_1_1 = 5.05; [L47] unsigned short int last_1_var_1_9 = 1; [L48] unsigned long int last_1_var_1_11 = 8; [L49] unsigned char last_1_var_1_14 = 32; [L50] unsigned char last_1_var_1_20 = 0; [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_11 = var_1_11 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_20 = var_1_20 [L164] RET updateLastVariables() [L165] CALL updateVariables() [L124] var_1_6 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L125] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L126] var_1_7 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L127] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L128] var_1_8 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L129] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L130] var_1_13 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L131] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L134] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L136] var_1_16 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L139] var_1_17 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L142] var_1_19 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L145] var_1_44 = __VERIFIER_nondet_ulong() [L146] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L146] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] COND FALSE !(((((var_1_9) < (var_1_14)) ? (var_1_9) : (var_1_14))) > var_1_18) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L57] COND FALSE !((var_1_15 <= var_1_9) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L68] COND TRUE var_1_17 > (- var_1_17) [L69] var_1_31 = (var_1_13 && var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L71] var_1_33 = var_1_15 [L72] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L73] COND TRUE ((var_1_7 - var_1_6) + var_1_6) == var_1_8 [L74] var_1_35 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L76] COND TRUE var_1_18 >= (~ var_1_19) [L77] var_1_40 = var_1_16 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L79] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L80] COND FALSE !(var_1_19 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=2, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L90] COND TRUE \read(var_1_13) [L91] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L95] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L104] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L105] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L109] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L110] COND FALSE !(var_1_18 >= stepLocal_0) [L113] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L115] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L116] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L118] COND TRUE \read(var_1_20) [L119] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L121] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-256, var_1_17=254, var_1_18=-12, var_1_19=-3, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=36, var_1_35=32, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 689 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 352 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 337 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 31 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 723 NumberOfCodeBlocks, 723 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 2182 SizeOfPredicates, 2 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 2421/2520 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:04:51,022 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_filler-ps-ci_file-70.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 b07a4b583601a48b942e5bdbd136c020a0a60c7f6ea7655680550275607bd971 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:04:52,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:04:52,865 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:04:52,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:04:52,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:04:52,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:04:52,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:04:52,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:04:52,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:04:52,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:04:52,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:04:52,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:04:52,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:04:52,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:04:52,900 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:04:52,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:04:52,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:04:52,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:04:52,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:04:52,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:04:52,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:04:52,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:04:52,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:04:52,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:04:52,906 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:04:52,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:04:52,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:04:52,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:04:52,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:04:52,907 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:04:52,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:04:52,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:04:52,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:04:52,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:04:52,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:52,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:04:52,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:04:52,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:04:52,909 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:04:52,909 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:04:52,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:04:52,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:04:52,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:04:52,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:04:52,910 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:04:52,910 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 -> b07a4b583601a48b942e5bdbd136c020a0a60c7f6ea7655680550275607bd971 [2024-10-11 10:04:53,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:04:53,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:04:53,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:04:53,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:04:53,165 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:04:53,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-70.i [2024-10-11 10:04:54,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:04:54,592 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:04:54,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-70.i [2024-10-11 10:04:54,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed5223ffd/c61234661cd3458e8ef9992215c3e299/FLAG02d4e5021 [2024-10-11 10:04:54,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed5223ffd/c61234661cd3458e8ef9992215c3e299 [2024-10-11 10:04:54,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:04:54,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:04:54,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:54,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:04:54,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:04:54,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:54,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0b00fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54, skipping insertion in model container [2024-10-11 10:04:54,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:54,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:04:54,825 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_filler-ps-ci_file-70.i[919,932] [2024-10-11 10:04:54,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:54,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:04:54,903 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_filler-ps-ci_file-70.i[919,932] [2024-10-11 10:04:54,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:54,967 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:04:54,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54 WrapperNode [2024-10-11 10:04:54,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:54,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:54,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:04:54,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:04:54,974 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:04:54" (1/1) ... [2024-10-11 10:04:54,989 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:04:54" (1/1) ... [2024-10-11 10:04:55,019 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-11 10:04:55,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:55,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:04:55,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:04:55,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:04:55,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,052 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:04:55,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:04:55,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:04:55,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:04:55,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:04:55,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (1/1) ... [2024-10-11 10:04:55,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:04:55,101 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:04:55,110 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:04:55,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:04:55,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:04:55,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:04:55,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:04:55,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:04:55,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:04:55,224 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:04:55,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:04:59,601 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 10:04:59,601 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:04:59,669 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:04:59,670 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:04:59,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:59 BoogieIcfgContainer [2024-10-11 10:04:59,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:04:59,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:04:59,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:04:59,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:04:59,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:04:54" (1/3) ... [2024-10-11 10:04:59,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d39622d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:59, skipping insertion in model container [2024-10-11 10:04:59,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:54" (2/3) ... [2024-10-11 10:04:59,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d39622d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:59, skipping insertion in model container [2024-10-11 10:04:59,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:59" (3/3) ... [2024-10-11 10:04:59,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-70.i [2024-10-11 10:04:59,691 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:04:59,691 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:04:59,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:04:59,751 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;@15b91419, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:04:59,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:04:59,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 40 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 10:04:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 10:04:59,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:59,765 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:59,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:59,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1822322114, now seen corresponding path program 1 times [2024-10-11 10:04:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:04:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812710470] [2024-10-11 10:04:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:59,784 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:04:59,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:04:59,788 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:04:59,789 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:05:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:00,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:05:00,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:05:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-11 10:05:00,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:05:00,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:05:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812710470] [2024-10-11 10:05:00,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812710470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:05:00,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:05:00,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:05:00,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606028475] [2024-10-11 10:05:00,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:05:00,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:05:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:05:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:05:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:05:00,256 INFO L87 Difference]: Start difference. First operand has 57 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 40 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 10:05:03,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:05:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:05:03,451 INFO L93 Difference]: Finished difference Result 111 states and 197 transitions. [2024-10-11 10:05:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:05:03,483 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2024-10-11 10:05:03,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:05:03,490 INFO L225 Difference]: With dead ends: 111 [2024-10-11 10:05:03,490 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 10:05:03,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:05:03,494 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:05:03,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 10:05:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 10:05:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 10:05:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 10:05:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2024-10-11 10:05:03,523 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 103 [2024-10-11 10:05:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:05:03,523 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-10-11 10:05:03,523 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 10:05:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2024-10-11 10:05:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 10:05:03,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:03,525 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,541 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:05:03,726 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:05:03,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:03,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:03,728 INFO L85 PathProgramCache]: Analyzing trace with hash -467096698, now seen corresponding path program 1 times [2024-10-11 10:05:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:05:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534043] [2024-10-11 10:05:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:03,730 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:05:03,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:05:03,732 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:05:03,733 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:05:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:04,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:05:04,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:05:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 10:05:05,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:05:05,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:05:05,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534043] [2024-10-11 10:05:05,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:05:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:05:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:05:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842577640] [2024-10-11 10:05:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:05:05,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:05:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:05:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:05:05,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:05:05,598 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 10:05:08,724 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:05:11,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:05:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:05:12,176 INFO L93 Difference]: Finished difference Result 150 states and 234 transitions. [2024-10-11 10:05:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:05:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-11 10:05:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:05:12,185 INFO L225 Difference]: With dead ends: 150 [2024-10-11 10:05:12,186 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 10:05:12,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:05:12,187 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 19 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:05:12,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 127 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-11 10:05:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 10:05:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2024-10-11 10:05:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:05:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2024-10-11 10:05:12,201 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 103 [2024-10-11 10:05:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:05:12,201 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2024-10-11 10:05:12,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 10:05:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2024-10-11 10:05:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 10:05:12,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:12,203 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:12,220 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 10:05:12,403 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:05:12,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:12,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2055444600, now seen corresponding path program 1 times [2024-10-11 10:05:12,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:05:12,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077749032] [2024-10-11 10:05:12,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:12,405 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:05:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:05:12,408 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:05:12,409 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:05:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:12,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:05:12,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:05:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-11 10:05:13,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:05:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 10:05:13,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:05:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077749032] [2024-10-11 10:05:13,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077749032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:05:13,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:05:13,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 10:05:13,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551446244] [2024-10-11 10:05:13,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:05:13,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:05:13,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:05:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:05:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:05:13,459 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 10:05:15,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:05:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:05:16,030 INFO L93 Difference]: Finished difference Result 151 states and 223 transitions. [2024-10-11 10:05:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:05:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 103 [2024-10-11 10:05:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:05:16,059 INFO L225 Difference]: With dead ends: 151 [2024-10-11 10:05:16,059 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 10:05:16,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:05:16,060 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:05:16,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 138 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 10:05:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 10:05:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-10-11 10:05:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:05:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-10-11 10:05:16,073 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 103 [2024-10-11 10:05:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:05:16,074 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-10-11 10:05:16,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 10:05:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-10-11 10:05:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 10:05:16,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:16,075 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:16,092 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 10:05:16,276 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:05:16,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:16,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash -60653808, now seen corresponding path program 1 times [2024-10-11 10:05:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:05:16,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027015352] [2024-10-11 10:05:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:16,278 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:05:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:05:16,279 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:05:16,283 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:05:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:16,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 10:05:16,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:05:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 10:05:18,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:05:18,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:05:18,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027015352] [2024-10-11 10:05:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027015352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:05:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1738136306] [2024-10-11 10:05:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:18,718 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:05:18,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:05:18,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:05:18,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 10:05:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:19,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 10:05:19,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:05:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 10:05:20,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:05:20,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1738136306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:05:20,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:05:20,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 10:05:20,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540123523] [2024-10-11 10:05:20,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:05:20,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:05:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:05:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:05:20,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:05:20,918 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 10:05:23,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:05:25,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:05:28,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:05:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:05:29,496 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2024-10-11 10:05:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 10:05:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-11 10:05:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:05:29,499 INFO L225 Difference]: With dead ends: 224 [2024-10-11 10:05:29,499 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 10:05:29,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-10-11 10:05:29,500 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:05:29,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 413 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-10-11 10:05:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 10:05:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2024-10-11 10:05:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 10:05:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2024-10-11 10:05:29,530 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 104 [2024-10-11 10:05:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:05:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2024-10-11 10:05:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 10:05:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2024-10-11 10:05:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 10:05:29,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:29,533 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-11 10:05:29,747 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 (5)] Ended with exit code 0 [2024-10-11 10:05:29,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /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:05:29,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:29,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash -3395506, now seen corresponding path program 1 times [2024-10-11 10:05:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:05:29,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589086779] [2024-10-11 10:05:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:29,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:05:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:05:29,937 INFO L229 MonitoredProcess]: Starting monitored process 7 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:05:29,938 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 (7)] Waiting until timeout for monitored process [2024-10-11 10:05:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:30,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 10:05:30,275 INFO L278 TraceCheckSpWp]: Computing forward predicates...