./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_codestructure_dependencies_file-90.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 bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:08:12,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:08:12,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:08:12,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:08:12,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:08:12,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:08:12,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:08:12,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:08:12,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:08:12,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:08:12,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:08:12,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:08:12,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:08:12,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:08:12,492 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:08:12,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:08:12,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:08:12,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:08:12,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:08:12,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:08:12,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:08:12,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:08:12,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:08:12,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:08:12,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:08:12,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:08:12,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:08:12,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:08:12,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:08:12,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:08:12,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:08:12,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:08:12,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:08:12,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:08:12,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:08:12,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:08:12,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:08:12,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:08:12,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:08:12,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:08:12,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:08:12,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:08:12,502 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 -> bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 [2024-11-12 01:08:12,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:08:12,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:08:12,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:08:12,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:08:12,794 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:08:12,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-12 01:08:14,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:08:14,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:08:14,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-12 01:08:14,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989efde5e/4a8a46d5e4434633a5200a9404023fcb/FLAGb4218b3eb [2024-11-12 01:08:14,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989efde5e/4a8a46d5e4434633a5200a9404023fcb [2024-11-12 01:08:14,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:08:14,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:08:14,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:08:14,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:08:14,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:08:14,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dada65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14, skipping insertion in model container [2024-11-12 01:08:14,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:08:14,762 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_codestructure_dependencies_file-90.i[919,932] [2024-11-12 01:08:14,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:08:14,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:08:14,835 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_codestructure_dependencies_file-90.i[919,932] [2024-11-12 01:08:14,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:08:14,882 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:08:14,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14 WrapperNode [2024-11-12 01:08:14,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:08:14,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:08:14,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:08:14,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:08:14,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,943 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-12 01:08:14,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:08:14,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:08:14,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:08:14,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:08:14,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,984 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-12 01:08:14,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:14,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:15,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:15,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:15,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:15,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:08:15,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:08:15,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:08:15,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:08:15,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (1/1) ... [2024-11-12 01:08:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:08:15,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:08:15,062 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-12 01:08:15,065 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-12 01:08:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:08:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:08:15,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:08:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:08:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:08:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:08:15,203 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:08:15,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:08:15,554 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 01:08:15,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:08:15,569 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:08:15,569 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:08:15,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:08:15 BoogieIcfgContainer [2024-11-12 01:08:15,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:08:15,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:08:15,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:08:15,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:08:15,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:08:14" (1/3) ... [2024-11-12 01:08:15,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ebb992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:08:15, skipping insertion in model container [2024-11-12 01:08:15,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:14" (2/3) ... [2024-11-12 01:08:15,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ebb992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:08:15, skipping insertion in model container [2024-11-12 01:08:15,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:08:15" (3/3) ... [2024-11-12 01:08:15,580 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-90.i [2024-11-12 01:08:15,601 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:08:15,601 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:08:15,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:08:15,665 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;@48a22285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:08:15,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:08:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 01:08:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 01:08:15,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:15,685 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:08:15,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:15,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1794822710, now seen corresponding path program 1 times [2024-11-12 01:08:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327970399] [2024-11-12 01:08:15,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:08:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:08:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 01:08:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:08:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 01:08:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:08:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 01:08:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:08:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 01:08:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 01:08:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:08:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:08:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:08:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 01:08:17,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:17,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327970399] [2024-11-12 01:08:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327970399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:08:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968566436] [2024-11-12 01:08:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:17,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:08:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:17,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:08:17,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:08:17,140 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 01:08:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:17,461 INFO L93 Difference]: Finished difference Result 179 states and 324 transitions. [2024-11-12 01:08:17,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:08:17,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-12 01:08:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:17,478 INFO L225 Difference]: With dead ends: 179 [2024-11-12 01:08:17,478 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 01:08:17,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:08:17,489 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 61 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:17,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 237 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:08:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 01:08:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2024-11-12 01:08:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 01:08:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 170 transitions. [2024-11-12 01:08:17,585 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 170 transitions. Word has length 117 [2024-11-12 01:08:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:17,586 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 170 transitions. [2024-11-12 01:08:17,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 01:08:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 170 transitions. [2024-11-12 01:08:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 01:08:17,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:17,593 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:08:17,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:08:17,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:17,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash 484453592, now seen corresponding path program 1 times [2024-11-12 01:08:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422934550] [2024-11-12 01:08:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:08:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:08:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 01:08:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:08:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 01:08:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:08:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 01:08:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:08:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 01:08:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 01:08:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:08:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:08:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:08:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 01:08:17,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422934550] [2024-11-12 01:08:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422934550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:08:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982608763] [2024-11-12 01:08:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:08:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:17,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:08:17,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:08:17,932 INFO L87 Difference]: Start difference. First operand 109 states and 170 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 01:08:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:18,119 INFO L93 Difference]: Finished difference Result 249 states and 387 transitions. [2024-11-12 01:08:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:08:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-12 01:08:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:18,125 INFO L225 Difference]: With dead ends: 249 [2024-11-12 01:08:18,125 INFO L226 Difference]: Without dead ends: 179 [2024-11-12 01:08:18,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:08:18,129 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 90 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:18,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 251 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:08:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-12 01:08:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2024-11-12 01:08:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 111 states have internal predecessors, (153), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:08:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 261 transitions. [2024-11-12 01:08:18,183 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 261 transitions. Word has length 119 [2024-11-12 01:08:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:18,185 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 261 transitions. [2024-11-12 01:08:18,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 01:08:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 261 transitions. [2024-11-12 01:08:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 01:08:18,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:18,188 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:08:18,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:08:18,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:18,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1942967792, now seen corresponding path program 1 times [2024-11-12 01:08:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100642736] [2024-11-12 01:08:18,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:08:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:08:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:08:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:08:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:08:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 01:08:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:08:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 01:08:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:08:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 01:08:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:08:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 01:08:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:08:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 01:08:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:08:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:08:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:08:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:08:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-12 01:08:18,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:08:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100642736] [2024-11-12 01:08:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100642736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:08:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778066734] [2024-11-12 01:08:18,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:18,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:08:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:08:18,684 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-12 01:08:18,686 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-12 01:08:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:18,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 01:08:18,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:08:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-12 01:08:19,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:08:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 51 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-12 01:08:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778066734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:08:19,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 01:08:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2024-11-12 01:08:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205789200] [2024-11-12 01:08:19,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 01:08:19,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:08:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:08:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:08:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:08:19,592 INFO L87 Difference]: Start difference. First operand 169 states and 261 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-12 01:08:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:19,903 INFO L93 Difference]: Finished difference Result 336 states and 492 transitions. [2024-11-12 01:08:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 01:08:19,905 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 121 [2024-11-12 01:08:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:19,907 INFO L225 Difference]: With dead ends: 336 [2024-11-12 01:08:19,908 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 01:08:19,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420 [2024-11-12 01:08:19,910 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 124 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:19,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 170 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:08:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 01:08:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2024-11-12 01:08:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:08:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 276 transitions. [2024-11-12 01:08:19,954 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 276 transitions. Word has length 121 [2024-11-12 01:08:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:19,955 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 276 transitions. [2024-11-12 01:08:19,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-12 01:08:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 276 transitions. [2024-11-12 01:08:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 01:08:19,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:19,957 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:08:19,981 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-12 01:08:20,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:08:20,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:20,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1684802354, now seen corresponding path program 1 times [2024-11-12 01:08:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:08:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620931354] [2024-11-12 01:08:20,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:08:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:08:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907111039] [2024-11-12 01:08:20,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:20,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:08:20,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:08:20,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:08:20,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 01:08:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:08:20,505 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:08:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:08:20,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:08:20,677 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:08:20,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:08:20,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 01:08:20,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-12 01:08:20,887 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 01:08:20,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:08:20,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:08:20 BoogieIcfgContainer [2024-11-12 01:08:20,979 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:08:20,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:08:20,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:08:20,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:08:20,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:08:15" (3/4) ... [2024-11-12 01:08:20,983 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:08:20,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:08:20,985 INFO L158 Benchmark]: Toolchain (without parser) took 6447.04ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 126.1MB in the beginning and 136.9MB in the end (delta: -10.9MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2024-11-12 01:08:20,985 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:08:20,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.77ms. Allocated memory is still 159.4MB. Free memory was 125.1MB in the beginning and 110.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 01:08:20,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.51ms. Allocated memory is still 159.4MB. Free memory was 110.6MB in the beginning and 107.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:08:20,986 INFO L158 Benchmark]: Boogie Preprocessor took 66.74ms. Allocated memory is still 159.4MB. Free memory was 107.4MB in the beginning and 104.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:08:20,986 INFO L158 Benchmark]: RCFGBuilder took 553.85ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 84.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 01:08:20,987 INFO L158 Benchmark]: TraceAbstraction took 5406.85ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 84.2MB in the beginning and 138.0MB in the end (delta: -53.8MB). Peak memory consumption was 777.1kB. Max. memory is 16.1GB. [2024-11-12 01:08:20,987 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 213.9MB. Free memory was 138.0MB in the beginning and 136.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:08:20,989 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.20ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.77ms. Allocated memory is still 159.4MB. Free memory was 125.1MB in the beginning and 110.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.51ms. Allocated memory is still 159.4MB. Free memory was 110.6MB in the beginning and 107.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.74ms. Allocated memory is still 159.4MB. Free memory was 107.4MB in the beginning and 104.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.85ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 84.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5406.85ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 84.2MB in the beginning and 138.0MB in the end (delta: -53.8MB). Peak memory consumption was 777.1kB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 213.9MB. Free memory was 138.0MB in the beginning and 136.9MB in the end (delta: 1.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 127, overapproximation of bitwiseOr at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -32; [L23] signed long int var_1_3 = 10; [L24] signed long int var_1_4 = 64; [L25] unsigned short int var_1_11 = 64; [L26] unsigned short int var_1_12 = 8; [L27] unsigned short int var_1_13 = 5; [L28] signed short int var_1_14 = 8; [L29] unsigned short int var_1_15 = 62763; [L30] unsigned long int var_1_16 = 25; [L31] float var_1_18 = 63.25; [L32] unsigned char var_1_20 = 0; [L33] float var_1_21 = 7.8; [L34] float var_1_22 = 32.1; [L35] unsigned char var_1_23 = 0; [L36] signed long int var_1_24 = -16; [L37] signed long int last_1_var_1_1 = -32; [L38] unsigned short int last_1_var_1_11 = 64; [L39] signed short int last_1_var_1_14 = 8; [L40] unsigned long int last_1_var_1_16 = 25; [L41] float last_1_var_1_18 = 63.25; VAL [isInitial=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_11 = var_1_11 [L122] last_1_var_1_14 = var_1_14 [L123] last_1_var_1_16 = var_1_16 [L124] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L91] var_1_3 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L92] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L93] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L93] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L98] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L98] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L99] var_1_12 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L100] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L101] CALL assume_abort_if_not(var_1_12 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L101] RET assume_abort_if_not(var_1_12 <= 16384) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L102] var_1_13 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L104] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L104] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L105] var_1_15 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L106] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L107] CALL assume_abort_if_not(var_1_15 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L107] RET assume_abort_if_not(var_1_15 <= 65535) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L110] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L110] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L111] var_1_21 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L112] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L113] var_1_22 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L114] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L115] var_1_23 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L116] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L117] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L117] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L135] RET updateVariables() [L136] CALL step() [L45] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L45] COND FALSE !((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) [L52] var_1_1 = last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L54] COND FALSE !((- (- last_1_var_1_18)) != last_1_var_1_18) [L61] var_1_24 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L63] COND FALSE !(((var_1_15 - var_1_12) + var_1_24) < var_1_24) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L66] COND FALSE !(var_1_24 < var_1_13) [L77] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L79] COND TRUE var_1_18 != (var_1_18 + var_1_18) [L80] var_1_11 = ((var_1_12 + var_1_13) + 32) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L82] COND FALSE !(((var_1_1 * var_1_4) + var_1_1) > var_1_1) [L87] var_1_16 = 0u VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L127-L128] return (((((((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) ? (((last_1_var_1_18 * last_1_var_1_18) < last_1_var_1_18) ? (var_1_1 == ((signed long int) last_1_var_1_11)) : (var_1_1 == ((signed long int) last_1_var_1_11))) : (var_1_1 == ((signed long int) last_1_var_1_11))) && ((var_1_18 != (var_1_18 + var_1_18)) ? (var_1_11 == ((unsigned short int) ((var_1_12 + var_1_13) + 32))) : 1)) && ((((var_1_15 - var_1_12) + var_1_24) < var_1_24) ? (var_1_14 == ((signed short int) var_1_12)) : 1)) && ((((var_1_1 * var_1_4) + var_1_1) > var_1_1) ? ((var_1_14 < var_1_1) ? (var_1_16 == ((unsigned long int) var_1_12)) : 1) : (var_1_16 == ((unsigned long int) 0u)))) && ((var_1_24 < var_1_13) ? (var_1_20 ? (var_1_18 == ((float) (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) + var_1_22))) : (var_1_23 ? (var_1_18 == ((float) (var_1_22 + var_1_21))) : (var_1_18 == ((float) -0.75f)))) : (var_1_18 == ((float) var_1_21)))) && (((- (- last_1_var_1_18)) != last_1_var_1_18) ? ((var_1_12 <= ((((last_1_var_1_14) > ((- last_1_var_1_14))) ? (last_1_var_1_14) : ((- last_1_var_1_14))))) ? (var_1_24 == ((signed long int) -50)) : (var_1_24 == ((signed long int) last_1_var_1_14))) : (var_1_24 == ((signed long int) last_1_var_1_14))) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 658 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 240 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 2671 SizeOfPredicates, 3 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2913/3060 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-12 01:08:21,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.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 bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:08:23,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:08:23,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:08:23,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:08:23,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:08:23,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:08:23,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:08:23,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:08:23,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:08:23,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:08:23,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:08:23,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:08:23,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:08:23,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:08:23,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:08:23,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:08:23,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:08:23,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:08:23,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:08:23,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:08:23,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:08:23,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:08:23,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:08:23,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:08:23,387 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:08:23,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:08:23,388 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:08:23,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:08:23,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:08:23,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:08:23,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:08:23,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:08:23,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:08:23,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:08:23,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:08:23,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:08:23,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:08:23,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:08:23,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:08:23,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:08:23,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:08:23,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:08:23,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:08:23,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:08:23,394 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 -> bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 [2024-11-12 01:08:23,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:08:23,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:08:23,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:08:23,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:08:23,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:08:23,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-12 01:08:25,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:08:25,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:08:25,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-12 01:08:25,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163d75c4d/3e338b40c7b84509a132aa1d7a36bb7e/FLAG4fe560491 [2024-11-12 01:08:25,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163d75c4d/3e338b40c7b84509a132aa1d7a36bb7e [2024-11-12 01:08:25,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:08:25,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:08:25,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:08:25,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:08:25,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:08:25,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:08:25" (1/1) ... [2024-11-12 01:08:25,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a48a03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:25, skipping insertion in model container [2024-11-12 01:08:25,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:08:25" (1/1) ... [2024-11-12 01:08:25,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:08:26,146 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_codestructure_dependencies_file-90.i[919,932] [2024-11-12 01:08:26,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:08:26,228 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:08:26,243 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_codestructure_dependencies_file-90.i[919,932] [2024-11-12 01:08:26,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:08:26,299 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:08:26,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26 WrapperNode [2024-11-12 01:08:26,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:08:26,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:08:26,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:08:26,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:08:26,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,360 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2024-11-12 01:08:26,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:08:26,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:08:26,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:08:26,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:08:26,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,396 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-12 01:08:26,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:08:26,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:08:26,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:08:26,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:08:26,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (1/1) ... [2024-11-12 01:08:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:08:26,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:08:26,471 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-12 01:08:26,475 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-12 01:08:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:08:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:08:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:08:26,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:08:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:08:26,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:08:26,625 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:08:26,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:08:27,593 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:08:27,593 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:08:27,605 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:08:27,605 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:08:27,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:08:27 BoogieIcfgContainer [2024-11-12 01:08:27,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:08:27,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:08:27,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:08:27,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:08:27,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:08:25" (1/3) ... [2024-11-12 01:08:27,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d779753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:08:27, skipping insertion in model container [2024-11-12 01:08:27,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:08:26" (2/3) ... [2024-11-12 01:08:27,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d779753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:08:27, skipping insertion in model container [2024-11-12 01:08:27,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:08:27" (3/3) ... [2024-11-12 01:08:27,613 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-90.i [2024-11-12 01:08:27,629 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:08:27,630 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:08:27,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:08:27,699 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;@655abfa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:08:27,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:08:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 01:08:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 01:08:27,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:27,720 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:08:27,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:27,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash -934770467, now seen corresponding path program 1 times [2024-11-12 01:08:27,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:08:27,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217447861] [2024-11-12 01:08:27,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:27,738 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-12 01:08:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:08:27,739 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-12 01:08:27,740 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-12 01:08:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:28,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:08:28,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:08:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-12 01:08:28,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:08:28,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:08:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217447861] [2024-11-12 01:08:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217447861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:08:28,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:08:28,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:08:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832183376] [2024-11-12 01:08:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:08:28,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:08:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:08:28,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:08:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:08:28,147 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 01:08:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:28,177 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2024-11-12 01:08:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:08:28,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-12 01:08:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:28,189 INFO L225 Difference]: With dead ends: 107 [2024-11-12 01:08:28,189 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 01:08:28,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-12 01:08:28,195 INFO L435 NwaCegarLoop]: 81 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, 81 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-12 01:08:28,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:08:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 01:08:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-12 01:08:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 01:08:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-11-12 01:08:28,235 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 114 [2024-11-12 01:08:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:28,236 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-11-12 01:08:28,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 01:08:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-11-12 01:08:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 01:08:28,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:28,241 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:08:28,250 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-12 01:08:28,442 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-12 01:08:28,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1577401253, now seen corresponding path program 1 times [2024-11-12 01:08:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:08:28,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344397362] [2024-11-12 01:08:28,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:28,445 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-12 01:08:28,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:08:28,448 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-12 01:08:28,449 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-12 01:08:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:28,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 01:08:28,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:08:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-12 01:08:29,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:08:30,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:08:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344397362] [2024-11-12 01:08:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344397362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:08:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072143279] [2024-11-12 01:08:30,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:30,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 01:08:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 01:08:30,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 01:08:30,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 01:08:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:31,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 01:08:31,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:08:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-12 01:08:32,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:08:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1072143279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:08:32,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:08:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-12 01:08:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792223667] [2024-11-12 01:08:32,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:08:32,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 01:08:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:08:32,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 01:08:32,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-12 01:08:32,769 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-12 01:08:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:08:35,203 INFO L93 Difference]: Finished difference Result 209 states and 309 transitions. [2024-11-12 01:08:35,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 01:08:35,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 114 [2024-11-12 01:08:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:08:35,215 INFO L225 Difference]: With dead ends: 209 [2024-11-12 01:08:35,215 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 01:08:35,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2024-11-12 01:08:35,217 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 01:08:35,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 418 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 01:08:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 01:08:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2024-11-12 01:08:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 86 states have internal predecessors, (116), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 01:08:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2024-11-12 01:08:35,259 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 114 [2024-11-12 01:08:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:08:35,260 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2024-11-12 01:08:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-12 01:08:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2024-11-12 01:08:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 01:08:35,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:08:35,263 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:08:35,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-12 01:08:35,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 01:08:35,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-12 01:08:35,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:08:35,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:08:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 768054627, now seen corresponding path program 1 times [2024-11-12 01:08:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:08:35,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750514311] [2024-11-12 01:08:35,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:08:35,667 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-12 01:08:35,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:08:35,670 INFO L229 MonitoredProcess]: Starting monitored process 5 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-12 01:08:35,671 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 (5)] Waiting until timeout for monitored process [2024-11-12 01:08:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:08:35,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 01:08:35,965 INFO L279 TraceCheckSpWp]: Computing forward predicates...