./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.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 a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:40:39,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:40:39,511 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:40:39,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:40:39,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:40:39,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:40:39,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:40:39,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:40:39,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:40:39,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:40:39,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:40:39,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:40:39,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:40:39,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:40:39,563 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:40:39,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:40:39,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:40:39,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:40:39,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:40:39,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:40:39,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:40:39,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:40:39,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:40:39,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:40:39,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:40:39,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:40:39,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:40:39,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:40:39,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:40:39,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:40:39,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:40:39,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:40:39,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:40:39,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:40:39,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:40:39,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:40:39,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:40:39,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:40:39,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:40:39,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:40:39,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:40:39,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:40:39,573 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 -> a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 [2024-10-11 10:40:39,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:40:39,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:40:39,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:40:39,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:40:39,871 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:40:39,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-10-11 10:40:41,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:40:41,576 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:40:41,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-10-11 10:40:41,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/67719fb34/ff5bac0ca6b345e1969f214ec2b57f72/FLAG9d2e7053c [2024-10-11 10:40:41,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/67719fb34/ff5bac0ca6b345e1969f214ec2b57f72 [2024-10-11 10:40:41,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:40:41,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:40:41,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:40:41,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:40:41,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:40:41,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:40:41" (1/1) ... [2024-10-11 10:40:41,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbaa709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:41, skipping insertion in model container [2024-10-11 10:40:41,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:40:41" (1/1) ... [2024-10-11 10:40:41,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:40:42,167 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-10-11 10:40:42,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:40:42,232 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:40:42,246 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-10-11 10:40:42,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:40:42,292 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:40:42,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42 WrapperNode [2024-10-11 10:40:42,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:40:42,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:40:42,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:40:42,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:40:42,301 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:40:42" (1/1) ... [2024-10-11 10:40:42,336 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:40:42" (1/1) ... [2024-10-11 10:40:42,398 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-10-11 10:40:42,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:40:42,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:40:42,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:40:42,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:40:42,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,451 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:40:42,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:40:42,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:40:42,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:40:42,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:40:42,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (1/1) ... [2024-10-11 10:40:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:40:42,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:40:42,533 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:40:42,540 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:40:42,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:40:42,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:40:42,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:40:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:40:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:40:42,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:40:42,687 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:40:42,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:40:43,042 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 10:40:43,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:40:43,082 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:40:43,082 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:40:43,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:40:43 BoogieIcfgContainer [2024-10-11 10:40:43,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:40:43,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:40:43,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:40:43,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:40:43,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:40:41" (1/3) ... [2024-10-11 10:40:43,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fb8c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:40:43, skipping insertion in model container [2024-10-11 10:40:43,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:40:42" (2/3) ... [2024-10-11 10:40:43,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fb8c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:40:43, skipping insertion in model container [2024-10-11 10:40:43,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:40:43" (3/3) ... [2024-10-11 10:40:43,091 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-95.i [2024-10-11 10:40:43,107 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:40:43,107 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:40:43,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:40:43,169 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;@cc0b9b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:40:43,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:40:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 42 states have internal predecessors, (63), 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:40:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:40:43,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:40:43,186 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] [2024-10-11 10:40:43,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:40:43,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:40:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 370027569, now seen corresponding path program 1 times [2024-10-11 10:40:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:40:43,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940745747] [2024-10-11 10:40:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:40:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:40:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:40:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:40:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:40:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:40:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:40:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:40:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:40:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:40:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:40:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:40:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:40:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:40:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:40:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:40:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:40:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:40:43,621 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:40:43,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:40:43,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940745747] [2024-10-11 10:40:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940745747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:40:43,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:40:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:40:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625910538] [2024-10-11 10:40:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:40:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:40:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:40:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:40:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:40:43,681 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 42 states have internal predecessors, (63), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:40:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:40:43,743 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2024-10-11 10:40:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:40:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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 100 [2024-10-11 10:40:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:40:43,759 INFO L225 Difference]: With dead ends: 114 [2024-10-11 10:40:43,759 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 10:40:43,763 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:40:43,770 INFO L432 NwaCegarLoop]: 82 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, 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, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:40:43,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:40:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 10:40:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 10:40:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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:40:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-11 10:40:43,812 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 100 [2024-10-11 10:40:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:40:43,812 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-11 10:40:43,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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:40:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-11 10:40:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:40:43,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:40:43,817 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] [2024-10-11 10:40:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:40:43,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:40:43,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:40:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1771441771, now seen corresponding path program 1 times [2024-10-11 10:40:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:40:43,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803522857] [2024-10-11 10:40:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:40:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:40:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:41:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:41:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:41:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:41:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:41:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:41:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:41:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:41:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:41:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:41:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:41:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:41:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:41:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:41:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:41:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:12,439 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:41:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:41:12,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803522857] [2024-10-11 10:41:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803522857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:41:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255332188] [2024-10-11 10:41:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:41:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:41:12,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:41:12,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:41:12,444 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:41:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:41:12,848 INFO L93 Difference]: Finished difference Result 186 states and 265 transitions. [2024-10-11 10:41:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:41:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 100 [2024-10-11 10:41:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:41:12,853 INFO L225 Difference]: With dead ends: 186 [2024-10-11 10:41:12,853 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 10:41:12,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:41:12,857 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 129 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:41:12,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 324 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:41:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 10:41:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2024-10-11 10:41:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 10:41:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2024-10-11 10:41:12,889 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 100 [2024-10-11 10:41:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:41:12,890 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 127 transitions. [2024-10-11 10:41:12,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:41:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 127 transitions. [2024-10-11 10:41:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:41:12,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:12,894 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] [2024-10-11 10:41:12,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:41:12,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:12,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 962095145, now seen corresponding path program 1 times [2024-10-11 10:41:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:41:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880289299] [2024-10-11 10:41:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:41:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:41:12,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164997713] [2024-10-11 10:41:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:12,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:41:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:41:12,983 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:41:12,984 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:41:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:41:13,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:41:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:41:13,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:41:13,453 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:41:13,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:41:13,474 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:41:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:41:13,660 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:41:13,749 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:41:13,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:41:13 BoogieIcfgContainer [2024-10-11 10:41:13,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:41:13,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:41:13,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:41:13,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:41:13,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:40:43" (3/4) ... [2024-10-11 10:41:13,761 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:41:13,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:41:13,763 INFO L158 Benchmark]: Toolchain (without parser) took 31817.48ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 101.0MB in the beginning and 776.8MB in the end (delta: -675.8MB). Peak memory consumption was 360.2MB. Max. memory is 16.1GB. [2024-10-11 10:41:13,763 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:41:13,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.34ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 85.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:41:13,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.30ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 122.8MB in the end (delta: -37.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-10-11 10:41:13,764 INFO L158 Benchmark]: Boogie Preprocessor took 84.38ms. Allocated memory is still 155.2MB. Free memory was 122.8MB in the beginning and 118.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:41:13,764 INFO L158 Benchmark]: RCFGBuilder took 597.41ms. Allocated memory is still 155.2MB. Free memory was 118.0MB in the beginning and 94.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 10:41:13,765 INFO L158 Benchmark]: TraceAbstraction took 30670.44ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 94.3MB in the beginning and 776.8MB in the end (delta: -682.5MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. [2024-10-11 10:41:13,765 INFO L158 Benchmark]: Witness Printer took 6.16ms. Allocated memory is still 1.2GB. Free memory is still 776.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:41:13,769 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.34ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 85.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.30ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 122.8MB in the end (delta: -37.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.38ms. Allocated memory is still 155.2MB. Free memory was 122.8MB in the beginning and 118.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 597.41ms. Allocated memory is still 155.2MB. Free memory was 118.0MB in the beginning and 94.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30670.44ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 94.3MB in the beginning and 776.8MB in the end (delta: -682.5MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. * Witness Printer took 6.16ms. Allocated memory is still 1.2GB. Free memory is still 776.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] double var_1_2 = 32.25; [L24] double var_1_3 = 16.5; [L25] unsigned char var_1_4 = 10; [L26] unsigned char var_1_5 = 100; [L27] unsigned char var_1_6 = 1; [L28] signed char var_1_7 = -5; [L29] unsigned char var_1_8 = 0; [L30] signed char var_1_9 = -10; [L31] signed short int var_1_10 = 64; [L32] unsigned short int var_1_11 = 0; [L33] float var_1_12 = 64.75; [L34] double var_1_13 = 5.4; [L35] float var_1_14 = 5.625; [L36] unsigned long int var_1_15 = 32; [L37] unsigned short int last_1_var_1_11 = 0; [L38] float last_1_var_1_12 = 64.75; [L39] unsigned long int last_1_var_1_15 = 32; [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L111] last_1_var_1_11 = var_1_11 [L112] last_1_var_1_12 = var_1_12 [L113] last_1_var_1_15 = var_1_15 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L86] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L88] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L89] var_1_4 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L91] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L93] RET assume_abort_if_not(var_1_5 >= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L94] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L95] var_1_6 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_7=-5, var_1_8=0, var_1_9=-10] [L96] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_7=-5, var_1_8=0, var_1_9=-10] [L97] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_9=-10] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_9=-10] [L100] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-10] [L100] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-10] [L101] var_1_9 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_9 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L102] RET assume_abort_if_not(var_1_9 >= -63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L103] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L103] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L104] var_1_13 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L106] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L106] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L108] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L124] RET updateVariables() [L125] CALL step() [L43] unsigned long int stepLocal_1 = var_1_6 - last_1_var_1_15; VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, stepLocal_1=31, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L44] EXPR last_1_var_1_11 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, stepLocal_1=31, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L44] COND FALSE !(stepLocal_1 < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) [L49] COND FALSE !((var_1_5 <= var_1_4) && var_1_8) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L56] COND TRUE (-8 * var_1_11) < var_1_4 [L57] var_1_7 = 1 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L62] COND TRUE 128 >= last_1_var_1_15 [L63] var_1_15 = (var_1_6 + (var_1_4 + var_1_11)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L67] COND FALSE !(var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L70] COND FALSE !((10.8 + var_1_12) <= (- var_1_12)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L73] unsigned char stepLocal_0 = var_1_4; VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L74] COND FALSE !(-4 >= stepLocal_0) [L81] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR (((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L116-L117] return (((((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1)) && ((var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_12 == ((float) var_1_14)) : 1)) && ((128 >= last_1_var_1_15) ? (var_1_15 == ((unsigned long int) (var_1_6 + (var_1_4 + var_1_11)))) : (var_1_15 == ((unsigned long int) var_1_7))) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=257, var_1_5=-161, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.5s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 230 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 176 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=2, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 45 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 840/840 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:41:13,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.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 a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:41:16,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:41:16,191 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:41:16,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:41:16,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:41:16,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:41:16,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:41:16,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:41:16,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:41:16,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:41:16,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:41:16,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:41:16,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:41:16,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:41:16,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:41:16,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:41:16,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:41:16,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:41:16,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:41:16,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:41:16,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:41:16,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:41:16,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:41:16,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:41:16,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:41:16,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:41:16,247 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:41:16,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:41:16,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:41:16,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:41:16,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:41:16,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:41:16,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:41:16,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:41:16,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:16,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:41:16,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:41:16,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:41:16,252 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:41:16,252 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:41:16,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:41:16,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:41:16,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:41:16,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:41:16,254 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:41:16,254 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 -> a15fad4ccd42e8290eb3eb8205bce76f0021d280a860af91ba29b3374a221b15 [2024-10-11 10:41:16,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:41:16,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:41:16,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:41:16,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:41:16,606 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:41:16,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-10-11 10:41:18,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:41:18,458 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:41:18,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i [2024-10-11 10:41:18,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdffd5b83/ffd16e15072640fa8118902a614a198c/FLAG396b3b305 [2024-10-11 10:41:18,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdffd5b83/ffd16e15072640fa8118902a614a198c [2024-10-11 10:41:18,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:41:18,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:41:18,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:18,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:41:18,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:41:18,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:18" (1/1) ... [2024-10-11 10:41:18,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9f8159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:18, skipping insertion in model container [2024-10-11 10:41:18,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:41:18" (1/1) ... [2024-10-11 10:41:18,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:41:19,052 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-10-11 10:41:19,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:19,146 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:41:19,157 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-95.i[913,926] [2024-10-11 10:41:19,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:41:19,216 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:41:19,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19 WrapperNode [2024-10-11 10:41:19,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:41:19,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:19,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:41:19,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:41:19,224 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:41:19" (1/1) ... [2024-10-11 10:41:19,241 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:41:19" (1/1) ... [2024-10-11 10:41:19,274 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-11 10:41:19,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:41:19,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:41:19,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:41:19,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:41:19,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,315 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:41:19,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:41:19,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:41:19,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:41:19,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:41:19,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (1/1) ... [2024-10-11 10:41:19,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:41:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:41:19,388 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:41:19,395 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:41:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:41:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:41:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:41:19,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:41:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:41:19,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:41:19,524 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:41:19,526 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:41:30,212 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 10:41:30,212 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:41:30,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:41:30,259 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:41:30,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:30 BoogieIcfgContainer [2024-10-11 10:41:30,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:41:30,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:41:30,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:41:30,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:41:30,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:41:18" (1/3) ... [2024-10-11 10:41:30,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcf3336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:30, skipping insertion in model container [2024-10-11 10:41:30,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:41:19" (2/3) ... [2024-10-11 10:41:30,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcf3336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:41:30, skipping insertion in model container [2024-10-11 10:41:30,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:41:30" (3/3) ... [2024-10-11 10:41:30,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-95.i [2024-10-11 10:41:30,288 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:41:30,289 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:41:30,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:41:30,360 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;@246e8621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:41:30,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:41:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:41:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 10:41:30,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:30,374 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] [2024-10-11 10:41:30,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1173957339, now seen corresponding path program 1 times [2024-10-11 10:41:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:41:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027457979] [2024-10-11 10:41:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:30,400 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:41:30,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:41:30,404 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:41:30,405 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:41:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:31,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:41:31,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:41:31,285 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:41:31,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:41:31,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:41:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027457979] [2024-10-11 10:41:31,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027457979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:31,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:31,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:41:31,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978570269] [2024-10-11 10:41:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:31,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:41:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:41:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:41:31,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:41:31,344 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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:41:35,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:41:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:41:35,651 INFO L93 Difference]: Finished difference Result 92 states and 161 transitions. [2024-10-11 10:41:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:41:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 97 [2024-10-11 10:41:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:41:35,750 INFO L225 Difference]: With dead ends: 92 [2024-10-11 10:41:35,750 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 10:41:35,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:41:35,755 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:41:35,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 10:41:35,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 10:41:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 10:41:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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:41:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-11 10:41:35,791 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 97 [2024-10-11 10:41:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:41:35,792 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-11 10:41:35,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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:41:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-11 10:41:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 10:41:35,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:41:35,799 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] [2024-10-11 10:41:35,827 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:41:36,000 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:41:36,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:41:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:41:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1355984171, now seen corresponding path program 1 times [2024-10-11 10:41:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:41:36,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359336427] [2024-10-11 10:41:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:41:36,004 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:41:36,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:41:36,007 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:41:36,010 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:41:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:41:36,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:41:36,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:41:41,853 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:41:41,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:41:41,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:41:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359336427] [2024-10-11 10:41:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359336427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:41:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:41:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:41:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244318782] [2024-10-11 10:41:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:41:41,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:41:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:41:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:41:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:41:41,858 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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:41:45,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:41:50,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:41:53,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:41:58,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:42:02,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:42:06,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []