./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.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 a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:59:55,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:59:55,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 21:59:55,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:59:55,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:59:55,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:59:55,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:59:55,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:59:55,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:59:55,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:59:55,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:59:55,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:59:55,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:59:55,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:59:55,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:59:55,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:59:55,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:59:55,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:59:55,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 21:59:55,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:59:55,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:59:55,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:59:55,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:59:55,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:59:55,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:59:55,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:59:55,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:59:55,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:59:55,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:59:55,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:59:55,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:59:55,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:59:55,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:59:55,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:59:55,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:59:55,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:59:55,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 21:59:55,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 21:59:55,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:59:55,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:59:55,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:59:55,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:59:55,687 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 -> a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e [2024-11-18 21:59:55,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:59:55,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:59:55,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:59:55,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:59:55,996 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:59:55,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i [2024-11-18 21:59:57,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:59:57,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:59:57,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i [2024-11-18 21:59:57,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda58620d/137707bfbe7944449f02e2fb3cbe0085/FLAG33fb112dc [2024-11-18 21:59:57,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda58620d/137707bfbe7944449f02e2fb3cbe0085 [2024-11-18 21:59:57,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:59:57,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:59:57,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:59:57,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:59:57,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:59:57,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:59:57" (1/1) ... [2024-11-18 21:59:57,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eb3d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:57, skipping insertion in model container [2024-11-18 21:59:57,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:59:57" (1/1) ... [2024-11-18 21:59:57,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:59:58,132 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_floatingpointinfluence_has-floats_file-3.i[916,929] [2024-11-18 21:59:58,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:59:58,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:59:58,234 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_floatingpointinfluence_has-floats_file-3.i[916,929] [2024-11-18 21:59:58,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:59:58,274 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:59:58,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58 WrapperNode [2024-11-18 21:59:58,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:59:58,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:59:58,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:59:58,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:59:58,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,326 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-18 21:59:58,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:59:58,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:59:58,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:59:58,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:59:58,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,354 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-18 21:59:58,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:59:58,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:59:58,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:59:58,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:59:58,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (1/1) ... [2024-11-18 21:59:58,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:59:58,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:59:58,427 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-18 21:59:58,430 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-18 21:59:58,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:59:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:59:58,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:59:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 21:59:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:59:58,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:59:58,592 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:59:58,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:59:58,870 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 21:59:58,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:59:58,890 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:59:58,892 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:59:58,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:59:58 BoogieIcfgContainer [2024-11-18 21:59:58,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:59:58,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:59:58,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:59:58,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:59:58,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:59:57" (1/3) ... [2024-11-18 21:59:58,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8ad0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:59:58, skipping insertion in model container [2024-11-18 21:59:58,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:58" (2/3) ... [2024-11-18 21:59:58,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8ad0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:59:58, skipping insertion in model container [2024-11-18 21:59:58,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:59:58" (3/3) ... [2024-11-18 21:59:58,904 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-3.i [2024-11-18 21:59:58,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:59:58,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:59:58,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:59:59,012 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;@5d908bcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:59:59,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:59:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 21:59:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 21:59:59,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:59,034 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:59:59,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 55740261, now seen corresponding path program 1 times [2024-11-18 21:59:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:59,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031386994] [2024-11-18 21:59:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:59:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 21:59:59,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:59:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031386994] [2024-11-18 21:59:59,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031386994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 21:59:59,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001886865] [2024-11-18 21:59:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:59,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:59:59,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:59:59,400 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-18 21:59:59,402 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-18 21:59:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:59,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:59:59,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:59:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 21:59:59,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:59:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001886865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:59:59,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 21:59:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 21:59:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383776854] [2024-11-18 21:59:59,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:59:59,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:59:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:59:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:59:59,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:59:59,641 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 21:59:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:59,683 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-18 21:59:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:59:59,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-18 21:59:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:59,694 INFO L225 Difference]: With dead ends: 97 [2024-11-18 21:59:59,694 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 21:59:59,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:59:59,704 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:59,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:59:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 21:59:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-18 21:59:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 21:59:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-18 21:59:59,753 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2024-11-18 21:59:59,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:59,754 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-18 21:59:59,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 21:59:59,754 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-18 21:59:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 21:59:59,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:59,759 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:59:59,775 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-18 21:59:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 21:59:59,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 322939501, now seen corresponding path program 1 times [2024-11-18 21:59:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615677385] [2024-11-18 21:59:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:00:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:00:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 22:00:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:00:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615677385] [2024-11-18 22:00:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615677385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:00:00,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:00:00,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:00:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397004799] [2024-11-18 22:00:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:00:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:00:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:00:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:00:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:00:00,367 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:00:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:00:00,404 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2024-11-18 22:00:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:00:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-18 22:00:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:00:00,410 INFO L225 Difference]: With dead ends: 138 [2024-11-18 22:00:00,411 INFO L226 Difference]: Without dead ends: 93 [2024-11-18 22:00:00,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:00:00,413 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:00:00,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:00:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-18 22:00:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-18 22:00:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 22:00:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-11-18 22:00:00,444 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2024-11-18 22:00:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:00:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-11-18 22:00:00,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:00:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-11-18 22:00:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 22:00:00,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:00:00,453 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:00:00,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:00:00,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:00:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:00:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 380197803, now seen corresponding path program 1 times [2024-11-18 22:00:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:00:00,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359337483] [2024-11-18 22:00:00,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:00:00,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:00:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:00:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-18 22:00:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:00:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359337483] [2024-11-18 22:00:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359337483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:00:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661159271] [2024-11-18 22:00:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:00:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:00:00,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:00:00,961 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-18 22:00:00,964 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-18 22:00:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:00:01,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 22:00:01,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:00:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-18 22:00:01,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:00:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-18 22:00:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661159271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:00:01,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:00:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-18 22:00:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024472662] [2024-11-18 22:00:01,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:00:01,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 22:00:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:00:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 22:00:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:00:01,670 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-18 22:00:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:00:01,891 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-11-18 22:00:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:00:01,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2024-11-18 22:00:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:00:01,898 INFO L225 Difference]: With dead ends: 193 [2024-11-18 22:00:01,899 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 22:00:01,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:00:01,901 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:00:01,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:00:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 22:00:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-18 22:00:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 22:00:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-18 22:00:01,927 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2024-11-18 22:00:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:00:01,927 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-18 22:00:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-18 22:00:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-18 22:00:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 22:00:01,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:00:01,930 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:00:01,948 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-18 22:00:02,133 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,SelfDestructingSolverStorable2 [2024-11-18 22:00:02,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:00:02,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:00:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash 382044845, now seen corresponding path program 1 times [2024-11-18 22:00:02,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:00:02,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459871070] [2024-11-18 22:00:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:00:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:00:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:00:02,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:00:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:00:02,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:00:02,268 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:00:02,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:00:02,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:00:02,277 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-18 22:00:02,349 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:00:02,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:00:02 BoogieIcfgContainer [2024-11-18 22:00:02,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:00:02,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:00:02,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:00:02,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:00:02,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:59:58" (3/4) ... [2024-11-18 22:00:02,359 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:00:02,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:00:02,361 INFO L158 Benchmark]: Toolchain (without parser) took 4461.30ms. Allocated memory was 186.6MB in the beginning and 245.4MB in the end (delta: 58.7MB). Free memory was 127.5MB in the beginning and 109.9MB in the end (delta: 17.6MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-11-18 22:00:02,361 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 186.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:00:02,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.56ms. Allocated memory is still 186.6MB. Free memory was 127.2MB in the beginning and 112.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:00:02,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.30ms. Allocated memory is still 186.6MB. Free memory was 112.7MB in the beginning and 110.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:00:02,362 INFO L158 Benchmark]: Boogie Preprocessor took 46.47ms. Allocated memory is still 186.6MB. Free memory was 110.3MB in the beginning and 107.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 22:00:02,362 INFO L158 Benchmark]: RCFGBuilder took 517.60ms. Allocated memory is still 186.6MB. Free memory was 107.4MB in the beginning and 92.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:00:02,363 INFO L158 Benchmark]: TraceAbstraction took 3457.37ms. Allocated memory was 186.6MB in the beginning and 245.4MB in the end (delta: 58.7MB). Free memory was 91.1MB in the beginning and 109.9MB in the end (delta: -18.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-11-18 22:00:02,363 INFO L158 Benchmark]: Witness Printer took 7.53ms. Allocated memory is still 245.4MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:00:02,364 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.25ms. Allocated memory is still 186.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.56ms. Allocated memory is still 186.6MB. Free memory was 127.2MB in the beginning and 112.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.30ms. Allocated memory is still 186.6MB. Free memory was 112.7MB in the beginning and 110.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.47ms. Allocated memory is still 186.6MB. Free memory was 110.3MB in the beginning and 107.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 517.60ms. Allocated memory is still 186.6MB. Free memory was 107.4MB in the beginning and 92.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3457.37ms. Allocated memory was 186.6MB in the beginning and 245.4MB in the end (delta: 58.7MB). Free memory was 91.1MB in the beginning and 109.9MB in the end (delta: -18.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * Witness Printer took 7.53ms. Allocated memory is still 245.4MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someUnaryDOUBLEoperation at line 33. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 15.75; [L33] double var_1_14 = -0.5; [L34] double var_1_15 = 5.25; [L35] double var_1_16 = 8.5; [L36] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L74] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L75] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L75] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L77] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L78] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L78] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L86] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L88] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L90] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L91] var_1_16 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L92] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L41] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L46] signed long int stepLocal_2 = var_1_7; [L47] signed long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, stepLocal_2=-1073741823, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L48] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L55] COND FALSE !(! var_1_11) [L58] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L60] COND FALSE !(\read(var_1_4)) [L63] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_11) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_1 || (! var_1_5))))) : 1)) && (var_1_4 ? (var_1_12 == ((double) (((((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) < ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))))))) ? ((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) : ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16)))))))))) : (var_1_12 == ((double) var_1_15))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 183 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304 SizeOfPredicates, 1 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2724/2880 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-18 22:00:02,400 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_floatingpointinfluence_has-floats_file-3.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 a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:00:04,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:00:05,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:00:05,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:00:05,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:00:05,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:00:05,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:00:05,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:00:05,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:00:05,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:00:05,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:00:05,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:00:05,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:00:05,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:00:05,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:00:05,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:00:05,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:00:05,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:00:05,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:00:05,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:00:05,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:00:05,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:00:05,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:00:05,122 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:00:05,122 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:00:05,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:00:05,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:00:05,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:00:05,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:00:05,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:00:05,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:00:05,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:00:05,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:00:05,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:00:05,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:00:05,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:00:05,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:00:05,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:00:05,127 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:00:05,128 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:00:05,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:00:05,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:00:05,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:00:05,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:00:05,129 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 -> a7653fcc22bc6223490ab137d2e71462c760555325edac4f323356ac25b70c1e [2024-11-18 22:00:05,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:00:05,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:00:05,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:00:05,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:00:05,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:00:05,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i [2024-11-18 22:00:07,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:00:07,515 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:00:07,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-3.i [2024-11-18 22:00:07,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba767736e/6dd0be383aa643798a3b1914388b3b3d/FLAG0805cc897 [2024-11-18 22:00:07,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba767736e/6dd0be383aa643798a3b1914388b3b3d [2024-11-18 22:00:07,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:00:07,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:00:07,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:00:07,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:00:07,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:00:07,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:07,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bcafd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07, skipping insertion in model container [2024-11-18 22:00:07,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:07,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:00:07,788 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_floatingpointinfluence_has-floats_file-3.i[916,929] [2024-11-18 22:00:07,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:00:07,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:00:07,894 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_floatingpointinfluence_has-floats_file-3.i[916,929] [2024-11-18 22:00:07,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:00:07,956 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:00:07,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07 WrapperNode [2024-11-18 22:00:07,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:00:07,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:00:07,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:00:07,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:00:07,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:07,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,023 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-18 22:00:08,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:00:08,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:00:08,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:00:08,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:00:08,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,066 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-18 22:00:08,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:00:08,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:00:08,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:00:08,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:00:08,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (1/1) ... [2024-11-18 22:00:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:00:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:00:08,147 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-18 22:00:08,155 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-18 22:00:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:00:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:00:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:00:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:00:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:00:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:00:08,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:00:08,304 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:00:09,042 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 22:00:09,043 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:00:09,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:00:09,081 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:00:09,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:00:09 BoogieIcfgContainer [2024-11-18 22:00:09,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:00:09,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:00:09,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:00:09,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:00:09,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:00:07" (1/3) ... [2024-11-18 22:00:09,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f767d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:00:09, skipping insertion in model container [2024-11-18 22:00:09,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:00:07" (2/3) ... [2024-11-18 22:00:09,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f767d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:00:09, skipping insertion in model container [2024-11-18 22:00:09,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:00:09" (3/3) ... [2024-11-18 22:00:09,094 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-3.i [2024-11-18 22:00:09,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:00:09,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:00:09,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:00:09,185 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;@207bfa3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:00:09,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:00:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:00:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 22:00:09,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:00:09,210 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:00:09,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:00:09,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:00:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 55740261, now seen corresponding path program 1 times [2024-11-18 22:00:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:00:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710893174] [2024-11-18 22:00:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:00:09,232 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-18 22:00:09,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:00:09,236 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-18 22:00:09,237 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-18 22:00:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:00:09,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:00:09,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:00:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-18 22:00:09,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:00:09,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:00:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710893174] [2024-11-18 22:00:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710893174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:00:09,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:00:09,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:00:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640031945] [2024-11-18 22:00:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:00:09,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:00:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:00:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:00:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:00:09,650 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:00:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:00:09,685 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-18 22:00:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:00:09,688 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-18 22:00:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:00:09,714 INFO L225 Difference]: With dead ends: 97 [2024-11-18 22:00:09,715 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 22:00:09,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-18 22:00:09,723 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:00:09,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:00:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 22:00:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-18 22:00:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:00:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-18 22:00:09,775 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2024-11-18 22:00:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:00:09,775 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-18 22:00:09,776 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:00:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-18 22:00:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 22:00:09,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:00:09,779 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:00:09,790 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 (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:00:09,980 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-18 22:00:09,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:00:09,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:00:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 322939501, now seen corresponding path program 1 times [2024-11-18 22:00:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:00:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114278102] [2024-11-18 22:00:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:00:09,991 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-18 22:00:09,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:00:09,997 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-18 22:00:10,001 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-18 22:00:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:00:10,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 22:00:10,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:00:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 22:00:10,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:00:10,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:00:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114278102] [2024-11-18 22:00:10,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114278102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:00:10,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:00:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:00:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490656566] [2024-11-18 22:00:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:00:10,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:00:10,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:00:10,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:00:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:00:10,650 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:00:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:00:10,941 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2024-11-18 22:00:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:00:10,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-18 22:00:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:00:10,948 INFO L225 Difference]: With dead ends: 138 [2024-11-18 22:00:10,948 INFO L226 Difference]: Without dead ends: 93 [2024-11-18 22:00:10,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:00:10,950 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:00:10,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:00:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-18 22:00:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-18 22:00:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 22:00:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-11-18 22:00:10,981 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2024-11-18 22:00:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:00:10,984 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-11-18 22:00:10,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:00:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-11-18 22:00:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 22:00:10,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:00:10,986 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:00:10,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 22:00:11,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:00:11,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:00:11,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:00:11,190 INFO L85 PathProgramCache]: Analyzing trace with hash 380197803, now seen corresponding path program 1 times [2024-11-18 22:00:11,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:00:11,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815794607] [2024-11-18 22:00:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:00:11,191 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-18 22:00:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:00:11,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:00:11,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 22:00:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:00:11,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 22:00:11,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:00:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-18 22:00:11,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:00:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-18 22:00:11,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:00:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815794607] [2024-11-18 22:00:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815794607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:00:11,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:00:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-18 22:00:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233568802] [2024-11-18 22:00:11,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:00:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 22:00:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:00:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 22:00:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:00:11,962 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-18 22:00:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:00:12,631 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-11-18 22:00:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:00:12,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2024-11-18 22:00:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:00:12,645 INFO L225 Difference]: With dead ends: 193 [2024-11-18 22:00:12,645 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 22:00:12,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:00:12,647 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 22:00:12,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 109 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 22:00:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 22:00:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-18 22:00:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 22:00:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-18 22:00:12,675 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2024-11-18 22:00:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:00:12,676 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-18 22:00:12,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-18 22:00:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-18 22:00:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 22:00:12,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:00:12,678 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:00:12,688 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 (4)] Forceful destruction successful, exit code 0 [2024-11-18 22:00:12,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-18 22:00:12,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:00:12,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:00:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash 382044845, now seen corresponding path program 1 times [2024-11-18 22:00:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:00:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678899273] [2024-11-18 22:00:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:00:12,882 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-18 22:00:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:00:12,885 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-18 22:00:12,886 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-18 22:00:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:00:13,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-18 22:00:13,178 INFO L278 TraceCheckSpWp]: Computing forward predicates...