./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4c4607917bfe1cc6bf79a319135ba22487b32050f4dc8556532199e914c9e32 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:10:27,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:10:27,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:10:27,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:10:27,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:10:27,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:10:27,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:10:27,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:10:27,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:10:27,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:10:27,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:10:27,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:10:27,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:10:27,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:10:27,595 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:10:27,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:10:27,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:10:27,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:10:27,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:10:27,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:10:27,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:10:27,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:10:27,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:10:27,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:10:27,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:10:27,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:10:27,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:10:27,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:10:27,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:10:27,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:10:27,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:10:27,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:10:27,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:10:27,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:10:27,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:10:27,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:10:27,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:10:27,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:10:27,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:10:27,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:10:27,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:10:27,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:10:27,608 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4c4607917bfe1cc6bf79a319135ba22487b32050f4dc8556532199e914c9e32 [2024-11-19 00:10:27,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:10:27,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:10:27,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:10:27,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:10:27,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:10:27,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i [2024-11-19 00:10:29,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:10:29,385 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:10:29,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i [2024-11-19 00:10:29,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a7aac5d/e7f1b8e2b5af45718e9f604c2fbcc842/FLAG94364d4ba [2024-11-19 00:10:29,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a7aac5d/e7f1b8e2b5af45718e9f604c2fbcc842 [2024-11-19 00:10:29,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:10:29,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:10:29,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:10:29,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:10:29,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:10:29,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a5f62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29, skipping insertion in model container [2024-11-19 00:10:29,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:10:29,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i[914,927] [2024-11-19 00:10:29,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:10:29,658 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:10:29,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i[914,927] [2024-11-19 00:10:29,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:10:29,765 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:10:29,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29 WrapperNode [2024-11-19 00:10:29,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:10:29,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:10:29,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:10:29,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:10:29,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,796 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-19 00:10:29,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:10:29,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:10:29,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:10:29,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:10:29,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,831 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:10:29,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:10:29,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:10:29,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:10:29,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:10:29,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (1/1) ... [2024-11-19 00:10:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:10:29,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:10:29,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:10:29,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:10:29,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:10:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:10:29,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:10:29,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:10:29,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:10:29,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:10:29,983 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:10:29,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:10:30,188 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 00:10:30,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:10:30,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:10:30,199 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:10:30,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:10:30 BoogieIcfgContainer [2024-11-19 00:10:30,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:10:30,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:10:30,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:10:30,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:10:30,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:10:29" (1/3) ... [2024-11-19 00:10:30,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dff81e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:10:30, skipping insertion in model container [2024-11-19 00:10:30,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:29" (2/3) ... [2024-11-19 00:10:30,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dff81e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:10:30, skipping insertion in model container [2024-11-19 00:10:30,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:10:30" (3/3) ... [2024-11-19 00:10:30,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-2.i [2024-11-19 00:10:30,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:10:30,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:10:30,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:10:30,278 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;@7095117, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:10:30,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:10:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:10:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 00:10:30,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:10:30,298 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:10:30,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:10:30,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:10:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2140347050, now seen corresponding path program 1 times [2024-11-19 00:10:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:10:30,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844310128] [2024-11-19 00:10:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:10:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:10:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 00:10:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:10:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844310128] [2024-11-19 00:10:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844310128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:10:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661949011] [2024-11-19 00:10:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:30,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:10:30,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:10:30,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:10:30,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:10:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:10:30,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:10:30,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:10:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-19 00:10:30,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:10:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661949011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:10:30,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:10:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:10:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558016607] [2024-11-19 00:10:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:10:30,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:10:30,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:10:30,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:10:30,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:10:30,729 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:10:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:10:30,748 INFO L93 Difference]: Finished difference Result 99 states and 163 transitions. [2024-11-19 00:10:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:10:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-19 00:10:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:10:30,755 INFO L225 Difference]: With dead ends: 99 [2024-11-19 00:10:30,756 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 00:10:30,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:10:30,760 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:10:30,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:10:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 00:10:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 00:10:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:10:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-19 00:10:30,829 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 91 [2024-11-19 00:10:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:10:30,831 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-19 00:10:30,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 00:10:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-19 00:10:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:10:30,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:10:30,835 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:10:30,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:10:31,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:10:31,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:10:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:10:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1331715252, now seen corresponding path program 1 times [2024-11-19 00:10:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:10:31,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702324529] [2024-11-19 00:10:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:10:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:10:31,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906418445] [2024-11-19 00:10:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:31,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:10:31,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:10:31,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:10:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:10:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:10:31,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:10:31,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:10:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-19 00:10:31,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:10:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 00:10:31,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:10:31,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702324529] [2024-11-19 00:10:31,939 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:10:31,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906418445] [2024-11-19 00:10:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906418445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:10:31,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:10:31,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 00:10:31,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835117124] [2024-11-19 00:10:31,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:10:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:10:31,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:10:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:10:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:10:31,943 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-19 00:10:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:10:32,199 INFO L93 Difference]: Finished difference Result 123 states and 170 transitions. [2024-11-19 00:10:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:10:32,200 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 92 [2024-11-19 00:10:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:10:32,201 INFO L225 Difference]: With dead ends: 123 [2024-11-19 00:10:32,201 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 00:10:32,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:10:32,203 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:10:32,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 176 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:10:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 00:10:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-11-19 00:10:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:10:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-19 00:10:32,216 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 92 [2024-11-19 00:10:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:10:32,217 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-19 00:10:32,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-19 00:10:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-19 00:10:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 00:10:32,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:10:32,219 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:10:32,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:10:32,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 00:10:32,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:10:32,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:10:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1161227543, now seen corresponding path program 1 times [2024-11-19 00:10:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:10:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981059900] [2024-11-19 00:10:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:10:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:10:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505607705] [2024-11-19 00:10:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:32,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:10:32,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:10:32,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:10:32,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:10:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:10:32,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:10:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:10:32,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:10:32,688 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:10:32,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:10:32,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:10:32,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:10:32,894 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 00:10:32,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:10:32,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:10:32 BoogieIcfgContainer [2024-11-19 00:10:32,969 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:10:32,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:10:32,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:10:32,970 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:10:32,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:10:30" (3/4) ... [2024-11-19 00:10:32,975 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:10:32,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:10:32,977 INFO L158 Benchmark]: Toolchain (without parser) took 3565.67ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 78.9MB in the beginning and 149.9MB in the end (delta: -70.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:10:32,977 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:10:32,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.77ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 78.8MB in the beginning and 176.9MB in the end (delta: -98.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-19 00:10:32,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.27ms. Allocated memory is still 205.5MB. Free memory was 176.9MB in the beginning and 174.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:10:32,977 INFO L158 Benchmark]: Boogie Preprocessor took 54.90ms. Allocated memory is still 205.5MB. Free memory was 174.8MB in the beginning and 171.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:10:32,978 INFO L158 Benchmark]: RCFGBuilder took 347.23ms. Allocated memory is still 205.5MB. Free memory was 171.7MB in the beginning and 154.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:10:32,978 INFO L158 Benchmark]: TraceAbstraction took 2768.23ms. Allocated memory is still 205.5MB. Free memory was 153.8MB in the beginning and 149.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-11-19 00:10:32,978 INFO L158 Benchmark]: Witness Printer took 6.63ms. Allocated memory is still 205.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:10:32,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.77ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 78.8MB in the beginning and 176.9MB in the end (delta: -98.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.27ms. Allocated memory is still 205.5MB. Free memory was 176.9MB in the beginning and 174.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.90ms. Allocated memory is still 205.5MB. Free memory was 174.8MB in the beginning and 171.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.23ms. Allocated memory is still 205.5MB. Free memory was 171.7MB in the beginning and 154.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2768.23ms. Allocated memory is still 205.5MB. Free memory was 153.8MB in the beginning and 149.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 6.63ms. Allocated memory is still 205.5MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryArithmeticDOUBLEoperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] unsigned long int last_1_var_1_6 = 10000; VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L90] var_1_4 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L91] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L92] var_1_5 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L93] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L94] var_1_8 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L95] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L96] var_1_11 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L97] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L98] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L98] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L99] var_1_12 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L100] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L101] var_1_13 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L102] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L103] var_1_15 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L104] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L105] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L105] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L106] var_1_16 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L108] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L108] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L109] var_1_18 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L111] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L111] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L125] RET updateVariables() [L126] CALL step() [L43] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L46] COND FALSE !((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) [L49] var_1_10 = 4.2f VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L51] var_1_20 = var_1_16 [L52] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000] [L53] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000] [L54] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L55] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000] [L62] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000] [L63] COND FALSE !(\read(var_1_17)) [L74] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=1] [L76] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=1] [L77] COND FALSE !(var_1_6 > var_1_6) [L80] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L85] COND TRUE var_1_1 < var_1_11 [L86] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 135 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 683 SizeOfPredicates, 3 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1206/1248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:10:33,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4c4607917bfe1cc6bf79a319135ba22487b32050f4dc8556532199e914c9e32 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:10:34,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:10:34,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:10:34,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:10:34,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:10:34,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:10:34,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:10:34,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:10:34,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:10:34,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:10:34,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:10:34,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:10:34,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:10:34,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:10:34,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:10:34,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:10:34,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:10:34,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:10:34,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:10:34,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:10:34,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:10:34,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:10:34,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:10:34,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:10:34,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:10:34,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:10:34,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:10:34,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:10:34,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:10:34,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:10:34,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:10:34,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:10:34,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:10:34,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:10:34,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:10:34,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:10:34,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:10:34,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:10:34,961 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:10:34,962 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:10:34,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:10:34,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:10:34,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:10:34,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:10:34,963 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4c4607917bfe1cc6bf79a319135ba22487b32050f4dc8556532199e914c9e32 [2024-11-19 00:10:35,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:10:35,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:10:35,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:10:35,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:10:35,273 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:10:35,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i [2024-11-19 00:10:36,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:10:36,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:10:36,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i [2024-11-19 00:10:36,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be23793a1/e86d0e6a5728417ea14f4bb52d43a4f9/FLAG86726ff3a [2024-11-19 00:10:37,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be23793a1/e86d0e6a5728417ea14f4bb52d43a4f9 [2024-11-19 00:10:37,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:10:37,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:10:37,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:10:37,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:10:37,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:10:37,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472ad514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37, skipping insertion in model container [2024-11-19 00:10:37,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:10:37,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i[914,927] [2024-11-19 00:10:37,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:10:37,575 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:10:37,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-2.i[914,927] [2024-11-19 00:10:37,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:10:37,632 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:10:37,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37 WrapperNode [2024-11-19 00:10:37,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:10:37,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:10:37,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:10:37,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:10:37,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,674 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-19 00:10:37,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:10:37,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:10:37,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:10:37,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:10:37,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,711 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:10:37,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:10:37,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:10:37,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:10:37,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:10:37,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (1/1) ... [2024-11-19 00:10:37,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:10:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:10:37,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:10:37,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:10:37,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:10:37,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:10:37,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:10:37,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:10:37,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:10:37,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:10:37,905 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:10:37,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:10:53,114 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 00:10:53,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:10:53,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:10:53,140 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:10:53,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:10:53 BoogieIcfgContainer [2024-11-19 00:10:53,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:10:53,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:10:53,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:10:53,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:10:53,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:10:37" (1/3) ... [2024-11-19 00:10:53,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebb1963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:10:53, skipping insertion in model container [2024-11-19 00:10:53,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:10:37" (2/3) ... [2024-11-19 00:10:53,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebb1963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:10:53, skipping insertion in model container [2024-11-19 00:10:53,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:10:53" (3/3) ... [2024-11-19 00:10:53,157 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-2.i [2024-11-19 00:10:53,169 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:10:53,170 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:10:53,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:10:53,242 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;@f437218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:10:53,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:10:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:10:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 00:10:53,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:10:53,261 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:10:53,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:10:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:10:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2140347050, now seen corresponding path program 1 times [2024-11-19 00:10:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:10:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004912670] [2024-11-19 00:10:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:10:53,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:10:53,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:10:53,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:10:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:10:53,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:10:53,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:10:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:10:53,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:10:53,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:10:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004912670] [2024-11-19 00:10:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004912670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:10:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:10:53,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:10:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224713796] [2024-11-19 00:10:53,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:10:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:10:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:10:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:10:53,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:10:53,951 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:10:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:10:53,972 INFO L93 Difference]: Finished difference Result 99 states and 163 transitions. [2024-11-19 00:10:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:10:53,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-19 00:10:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:10:53,981 INFO L225 Difference]: With dead ends: 99 [2024-11-19 00:10:53,981 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 00:10:53,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:10:53,987 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:10:53,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:10:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 00:10:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 00:10:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:10:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-19 00:10:54,028 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 91 [2024-11-19 00:10:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:10:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-19 00:10:54,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 00:10:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-19 00:10:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 00:10:54,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:10:54,032 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:10:54,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:10:54,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:10:54,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:10:54,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:10:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1331715252, now seen corresponding path program 1 times [2024-11-19 00:10:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:10:54,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080919844] [2024-11-19 00:10:54,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:10:54,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:10:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:10:54,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:10:54,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:10:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:10:54,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:10:54,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:10:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-19 00:10:55,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:10:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 00:10:56,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:10:56,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080919844] [2024-11-19 00:10:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080919844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:10:56,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:10:56,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-19 00:10:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810250411] [2024-11-19 00:10:56,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:10:56,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:10:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:10:56,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:10:56,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:10:56,761 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 00:10:59,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:11:03,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:11:07,576 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-11-19 00:11:11,584 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-11-19 00:11:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:11:12,639 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2024-11-19 00:11:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:11:12,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 92 [2024-11-19 00:11:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:11:12,646 INFO L225 Difference]: With dead ends: 125 [2024-11-19 00:11:12,646 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 00:11:12,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:11:12,648 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 59 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:11:12,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 161 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 176 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2024-11-19 00:11:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 00:11:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-11-19 00:11:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:11:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-19 00:11:12,668 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 92 [2024-11-19 00:11:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:11:12,668 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-19 00:11:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 00:11:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-19 00:11:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 00:11:12,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:11:12,672 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:11:12,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:11:12,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:11:12,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:11:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:11:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1161227543, now seen corresponding path program 1 times [2024-11-19 00:11:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:11:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176203484] [2024-11-19 00:11:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:11:12,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:11:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:11:12,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:11:12,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:11:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:11:13,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 00:11:13,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:11:38,288 WARN L286 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 00:11:49,884 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 00:11:56,546 WARN L286 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 00:12:10,506 WARN L286 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)