./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_amount25_file-55.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 d49cb19ea73a8e7e65d41ce21711c83229aec8ad3b628b5fca5a19c20a6562dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:51:16,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:51:16,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:51:16,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:51:16,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:51:17,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:51:17,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:51:17,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:51:17,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:51:17,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:51:17,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:51:17,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:51:17,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:51:17,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:51:17,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:51:17,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:51:17,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:51:17,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:51:17,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:51:17,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:51:17,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:51:17,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:51:17,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:51:17,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:51:17,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:51:17,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:51:17,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:51:17,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:51:17,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:51:17,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:51:17,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:51:17,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:51:17,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:17,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:51:17,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:51:17,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:51:17,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:51:17,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:51:17,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:51:17,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:51:17,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:51:17,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:51:17,022 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 -> d49cb19ea73a8e7e65d41ce21711c83229aec8ad3b628b5fca5a19c20a6562dd [2024-11-09 00:51:17,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:51:17,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:51:17,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:51:17,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:51:17,325 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:51:17,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-55.i [2024-11-09 00:51:18,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:51:18,979 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:51:18,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-55.i [2024-11-09 00:51:18,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73736597a/40094fe345a14da6988ab9c60abeb629/FLAGd98564bfd [2024-11-09 00:51:19,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73736597a/40094fe345a14da6988ab9c60abeb629 [2024-11-09 00:51:19,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:51:19,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:51:19,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:19,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:51:19,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:51:19,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7c4e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19, skipping insertion in model container [2024-11-09 00:51:19,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:51:19,593 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_amount25_file-55.i[915,928] [2024-11-09 00:51:19,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:19,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:51:19,662 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_amount25_file-55.i[915,928] [2024-11-09 00:51:19,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:19,708 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:51:19,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19 WrapperNode [2024-11-09 00:51:19,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:19,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:19,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:51:19,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:51:19,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,748 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-09 00:51:19,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:19,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:51:19,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:51:19,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:51:19,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,777 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-09 00:51:19,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:51:19,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:51:19,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:51:19,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:51:19,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (1/1) ... [2024-11-09 00:51:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:19,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:51:19,839 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-09 00:51:19,841 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-09 00:51:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:51:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:51:19,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:51:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:51:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:51:19,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:51:19,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:51:19,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:51:20,263 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:51:20,263 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:51:20,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:51:20,281 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:51:20,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:20 BoogieIcfgContainer [2024-11-09 00:51:20,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:51:20,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:51:20,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:51:20,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:51:20,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:51:19" (1/3) ... [2024-11-09 00:51:20,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d59252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:20, skipping insertion in model container [2024-11-09 00:51:20,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:19" (2/3) ... [2024-11-09 00:51:20,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d59252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:20, skipping insertion in model container [2024-11-09 00:51:20,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:20" (3/3) ... [2024-11-09 00:51:20,290 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-55.i [2024-11-09 00:51:20,304 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:51:20,305 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:51:20,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:51:20,362 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;@3ef65090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:51:20,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:51:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 00:51:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 00:51:20,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:20,376 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:20,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:20,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash -93781093, now seen corresponding path program 1 times [2024-11-09 00:51:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255901677] [2024-11-09 00:51:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:51:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:51:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:51:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:51:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:51:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:51:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:51:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:51:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:51:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:51:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:51:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 00:51:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:51:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 00:51:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:51:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:51:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:51:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 00:51:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:51:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255901677] [2024-11-09 00:51:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255901677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:20,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:20,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:51:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224346380] [2024-11-09 00:51:20,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:20,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:51:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:51:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:51:20,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:20,863 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:51:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:20,892 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-09 00:51:20,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:51:20,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-11-09 00:51:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:20,901 INFO L225 Difference]: With dead ends: 95 [2024-11-09 00:51:20,901 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 00:51:20,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-09 00:51:20,908 INFO L432 NwaCegarLoop]: 68 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, 68 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-09 00:51:20,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 00:51:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 00:51:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 00:51:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-09 00:51:20,953 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 106 [2024-11-09 00:51:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:20,955 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-09 00:51:20,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:51:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-09 00:51:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 00:51:20,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:20,960 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:20,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:51:20,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 807760285, now seen corresponding path program 1 times [2024-11-09 00:51:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318143710] [2024-11-09 00:51:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:51:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198818577] [2024-11-09 00:51:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:21,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:51:21,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:51:21,093 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-09 00:51:21,094 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-09 00:51:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:21,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:51:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:51:21,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:51:21,450 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:51:21,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:51:21,464 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-09 00:51:21,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:51:21,662 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:51:21,736 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:51:21,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:51:21 BoogieIcfgContainer [2024-11-09 00:51:21,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:51:21,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:51:21,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:51:21,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:51:21,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:20" (3/4) ... [2024-11-09 00:51:21,743 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:51:21,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:51:21,745 INFO L158 Benchmark]: Toolchain (without parser) took 2367.38ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 112.6MB in the beginning and 142.0MB in the end (delta: -29.4MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-11-09 00:51:21,745 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:51:21,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.99ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 97.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:51:21,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.21ms. Allocated memory is still 165.7MB. Free memory was 97.8MB in the beginning and 95.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:51:21,747 INFO L158 Benchmark]: Boogie Preprocessor took 43.99ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 93.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:51:21,748 INFO L158 Benchmark]: RCFGBuilder took 485.32ms. Allocated memory is still 165.7MB. Free memory was 93.0MB in the beginning and 77.0MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:51:21,748 INFO L158 Benchmark]: TraceAbstraction took 1455.41ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 76.2MB in the beginning and 142.0MB in the end (delta: -65.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:51:21,750 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 226.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:51:21,754 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.19ms. Allocated memory is still 165.7MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.99ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 97.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.21ms. Allocated memory is still 165.7MB. Free memory was 97.8MB in the beginning and 95.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.99ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 93.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 485.32ms. Allocated memory is still 165.7MB. Free memory was 93.0MB in the beginning and 77.0MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1455.41ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 76.2MB in the beginning and 142.0MB in the end (delta: -65.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 226.5MB. Free memory is still 142.0MB. 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 98, overapproximation of someBinaryArithmeticFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 25; [L27] unsigned short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 1; [L29] signed char var_1_12 = 1; [L30] float var_1_13 = 127.75; [L31] float var_1_14 = 0.0; [L32] float var_1_15 = 255.7; [L33] float var_1_16 = 7.6; [L34] unsigned long int var_1_17 = 64; [L35] signed long int var_1_18 = 0; VAL [isInitial=0, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L74] var_1_6 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L76] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=5, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L80] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L81] var_1_9 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535] [L82] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535] [L83] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535] [L83] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535] [L84] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L84] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L86] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L87] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L88] var_1_14 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L89] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L91] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L93] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L106] RET updateVariables() [L107] CALL step() [L39] var_1_13 = ((var_1_14 - var_1_15) - var_1_16) [L40] var_1_17 = var_1_6 [L41] var_1_18 = var_1_9 [L42] unsigned short int stepLocal_3 = var_1_9; [L43] unsigned long int stepLocal_2 = var_1_17; VAL [isInitial=1, stepLocal_2=1, stepLocal_3=1, var_1_12=-127, var_1_17=1, var_1_18=1, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=25, var_1_8=65535, var_1_9=1] [L44] COND FALSE !(stepLocal_2 <= ((var_1_17 / var_1_8) / var_1_9)) [L51] var_1_7 = var_1_12 VAL [isInitial=1, stepLocal_3=1, var_1_12=-127, var_1_17=1, var_1_18=1, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=65535, var_1_9=1] [L53] signed char stepLocal_1 = var_1_7; [L54] unsigned char stepLocal_0 = var_1_7 >= var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=1, var_1_12=-127, var_1_17=1, var_1_18=1, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=65535, var_1_9=1] [L55] COND FALSE !(\read(var_1_2)) [L64] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=1, var_1_12=-127, var_1_17=1, var_1_18=1, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=65535, var_1_9=1] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_2 ? (((var_1_7 >= var_1_7) && var_1_5) ? ((var_1_7 >= var_1_7) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) var_1_6))) : 1) : (var_1_1 == ((unsigned short int) var_1_6))) && ((var_1_17 <= ((var_1_17 / var_1_8) / var_1_9)) ? ((var_1_9 == (var_1_18 * (~ var_1_18))) ? (var_1_7 == ((signed char) var_1_12)) : (var_1_7 == ((signed char) var_1_12))) : (var_1_7 == ((signed char) var_1_12)))) && (var_1_13 == ((float) ((var_1_14 - var_1_15) - var_1_16)))) && (var_1_17 == ((unsigned long int) var_1_6))) && (var_1_18 == ((signed long int) var_1_9)) ; VAL [\result=0, isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=1, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=65535, var_1_9=1] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=1, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=65535, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_12=-127, var_1_17=1, var_1_18=1, var_1_1=1, var_1_2=0, var_1_5=1, var_1_6=1, var_1_7=-127, var_1_8=65535, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 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-09 00:51:21,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_amount25_file-55.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 d49cb19ea73a8e7e65d41ce21711c83229aec8ad3b628b5fca5a19c20a6562dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:51:23,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:51:24,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:51:24,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:51:24,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:51:24,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:51:24,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:51:24,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:51:24,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:51:24,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:51:24,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:51:24,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:51:24,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:51:24,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:51:24,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:51:24,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:51:24,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:51:24,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:51:24,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:51:24,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:51:24,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:51:24,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:51:24,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:51:24,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:51:24,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:51:24,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:51:24,078 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:51:24,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:51:24,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:51:24,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:51:24,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:51:24,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:51:24,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:51:24,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:51:24,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:24,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:51:24,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:51:24,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:51:24,082 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:51:24,083 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:51:24,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:51:24,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:51:24,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:51:24,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:51:24,087 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 -> d49cb19ea73a8e7e65d41ce21711c83229aec8ad3b628b5fca5a19c20a6562dd [2024-11-09 00:51:24,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:51:24,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:51:24,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:51:24,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:51:24,412 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:51:24,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-55.i [2024-11-09 00:51:25,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:51:26,085 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:51:26,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-55.i [2024-11-09 00:51:26,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86181049b/f4dcd0ba0e41411eb6b986c6424ee600/FLAG658dc32d8 [2024-11-09 00:51:26,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86181049b/f4dcd0ba0e41411eb6b986c6424ee600 [2024-11-09 00:51:26,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:51:26,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:51:26,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:26,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:51:26,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:51:26,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319e272a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26, skipping insertion in model container [2024-11-09 00:51:26,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:51:26,670 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_amount25_file-55.i[915,928] [2024-11-09 00:51:26,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:26,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:51:26,783 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_amount25_file-55.i[915,928] [2024-11-09 00:51:26,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:51:26,833 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:51:26,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26 WrapperNode [2024-11-09 00:51:26,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:51:26,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:26,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:51:26,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:51:26,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,886 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-09 00:51:26,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:51:26,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:51:26,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:51:26,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:51:26,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,919 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-09 00:51:26,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:51:26,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:51:26,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:51:26,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:51:26,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (1/1) ... [2024-11-09 00:51:26,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:51:26,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:51:26,982 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-09 00:51:26,985 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-09 00:51:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:51:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:51:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:51:27,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:51:27,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:51:27,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:51:27,104 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:51:27,106 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:51:27,418 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:51:27,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:51:27,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:51:27,437 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:51:27,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:27 BoogieIcfgContainer [2024-11-09 00:51:27,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:51:27,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:51:27,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:51:27,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:51:27,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:51:26" (1/3) ... [2024-11-09 00:51:27,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390e8d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:27, skipping insertion in model container [2024-11-09 00:51:27,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:51:26" (2/3) ... [2024-11-09 00:51:27,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390e8d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:51:27, skipping insertion in model container [2024-11-09 00:51:27,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:51:27" (3/3) ... [2024-11-09 00:51:27,446 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-55.i [2024-11-09 00:51:27,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:51:27,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:51:27,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:51:27,529 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;@528cc876, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:51:27,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:51:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 00:51:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 00:51:27,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:27,543 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:27,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:27,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -93781093, now seen corresponding path program 1 times [2024-11-09 00:51:27,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:27,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750922577] [2024-11-09 00:51:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:27,560 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-09 00:51:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:27,563 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-09 00:51:27,564 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-09 00:51:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:27,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:51:27,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:51:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-09 00:51:27,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:51:27,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:51:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750922577] [2024-11-09 00:51:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750922577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:51:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145607377] [2024-11-09 00:51:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:27,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:51:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:51:27,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:51:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:51:27,932 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:51:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:27,963 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-09 00:51:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:51:27,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-11-09 00:51:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:27,975 INFO L225 Difference]: With dead ends: 95 [2024-11-09 00:51:27,975 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 00:51:27,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-09 00:51:27,985 INFO L432 NwaCegarLoop]: 68 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, 68 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-09 00:51:27,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:51:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 00:51:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 00:51:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 00:51:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-09 00:51:28,033 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 106 [2024-11-09 00:51:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:28,034 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-09 00:51:28,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 00:51:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-09 00:51:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 00:51:28,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:28,041 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:51:28,053 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-09 00:51:28,242 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-09 00:51:28,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:28,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash 807760285, now seen corresponding path program 1 times [2024-11-09 00:51:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:51:28,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192578452] [2024-11-09 00:51:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:28,245 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-09 00:51:28,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:51:28,248 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-09 00:51:28,249 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-09 00:51:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:28,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 00:51:28,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:51:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-09 00:51:58,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:51:58,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:51:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192578452] [2024-11-09 00:51:58,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192578452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:58,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:58,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 00:51:58,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050544139] [2024-11-09 00:51:58,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:58,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 00:51:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:51:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 00:51:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:51:58,803 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 00:52:13,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:52:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:52:34,653 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2024-11-09 00:52:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 00:52:34,654 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 106 [2024-11-09 00:52:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:52:34,657 INFO L225 Difference]: With dead ends: 99 [2024-11-09 00:52:34,657 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 00:52:34,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-11-09 00:52:34,658 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 90 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:52:34,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 344 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2024-11-09 00:52:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 00:52:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2024-11-09 00:52:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 00:52:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2024-11-09 00:52:34,681 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 106 [2024-11-09 00:52:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:52:34,682 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2024-11-09 00:52:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 00:52:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2024-11-09 00:52:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 00:52:34,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:34,688 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:52:34,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:52:34,889 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-09 00:52:34,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:34,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:34,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1134723106, now seen corresponding path program 1 times [2024-11-09 00:52:34,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:52:34,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097895880] [2024-11-09 00:52:34,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:34,892 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-09 00:52:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:52:34,895 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-09 00:52:34,896 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-09 00:52:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:35,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 00:52:35,131 INFO L278 TraceCheckSpWp]: Computing forward predicates...