./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:21:10,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:21:10,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:21:10,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:21:10,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:21:10,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:21:10,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:21:10,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:21:10,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:21:10,960 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:21:10,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:21:10,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:21:10,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:21:10,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:21:10,961 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:21:10,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:21:10,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:21:10,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:21:10,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:21:10,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:21:10,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:21:10,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:21:10,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:21:10,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:21:10,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:21:10,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:21:10,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:21:10,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:21:10,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:21:10,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:21:10,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:21:10,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:21:10,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:21:10,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:21:10,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:21:10,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:21:10,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:21:10,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:21:10,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:21:10,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:21:10,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:21:10,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:21:10,973 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2024-10-11 00:21:11,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:21:11,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:21:11,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:21:11,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:21:11,255 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:21:11,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-10-11 00:21:12,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:21:12,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:21:12,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-10-11 00:21:12,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/344c00581/a9ffda48856c4640ac08a739d9e5b094/FLAGe285d8287 [2024-10-11 00:21:13,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/344c00581/a9ffda48856c4640ac08a739d9e5b094 [2024-10-11 00:21:13,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:21:13,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:21:13,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:21:13,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:21:13,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:21:13,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c6bee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13, skipping insertion in model container [2024-10-11 00:21:13,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:21:13,464 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-10-11 00:21:13,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:21:13,491 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:21:13,531 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-10-11 00:21:13,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:21:13,549 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:21:13,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13 WrapperNode [2024-10-11 00:21:13,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:21:13,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:21:13,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:21:13,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:21:13,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,584 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-10-11 00:21:13,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:21:13,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:21:13,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:21:13,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:21:13,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 00:21:13,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:21:13,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:21:13,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:21:13,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:21:13,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (1/1) ... [2024-10-11 00:21:13,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:21:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:21:13,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:21:13,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:21:13,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:21:13,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:21:13,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:21:13,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:21:13,809 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:21:13,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:21:13,974 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 00:21:13,975 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:21:14,006 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:21:14,007 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 00:21:14,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:14 BoogieIcfgContainer [2024-10-11 00:21:14,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:21:14,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:21:14,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:21:14,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:21:14,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:21:13" (1/3) ... [2024-10-11 00:21:14,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7255a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:14, skipping insertion in model container [2024-10-11 00:21:14,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:13" (2/3) ... [2024-10-11 00:21:14,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7255a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:14, skipping insertion in model container [2024-10-11 00:21:14,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:14" (3/3) ... [2024-10-11 00:21:14,020 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2024-10-11 00:21:14,038 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:21:14,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:21:14,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:21:14,105 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;@45548246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:21:14,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:21:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:21:14,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:14,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:14,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:14,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1321548500, now seen corresponding path program 1 times [2024-10-11 00:21:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:21:14,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640898903] [2024-10-11 00:21:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:21:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:21:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:21:14,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640898903] [2024-10-11 00:21:14,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640898903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:14,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:14,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:21:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164549444] [2024-10-11 00:21:14,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:14,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:21:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:21:14,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:21:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:21:14,333 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:14,362 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2024-10-11 00:21:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:21:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 00:21:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:14,372 INFO L225 Difference]: With dead ends: 34 [2024-10-11 00:21:14,373 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 00:21:14,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-11 00:21:14,379 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 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-10-11 00:21:14,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:21:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 00:21:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 00:21:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-10-11 00:21:14,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 12 [2024-10-11 00:21:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:14,408 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-11 00:21:14,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2024-10-11 00:21:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:21:14,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:14,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:21:14,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:14,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1145487481, now seen corresponding path program 1 times [2024-10-11 00:21:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:21:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533543865] [2024-10-11 00:21:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:21:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:21:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:21:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533543865] [2024-10-11 00:21:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533543865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:14,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:21:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246986530] [2024-10-11 00:21:14,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:14,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:21:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:21:14,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:21:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:21:14,500 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:14,521 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2024-10-11 00:21:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:21:14,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 00:21:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:14,522 INFO L225 Difference]: With dead ends: 18 [2024-10-11 00:21:14,523 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 00:21:14,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:21:14,524 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:21:14,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:21:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 00:21:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 00:21:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-11 00:21:14,528 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2024-10-11 00:21:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:14,528 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-11 00:21:14,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-10-11 00:21:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:21:14,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:14,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:14,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:21:14,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:14,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1162498142, now seen corresponding path program 1 times [2024-10-11 00:21:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:21:14,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016798273] [2024-10-11 00:21:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:21:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:21:14,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 00:21:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:21:14,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 00:21:14,568 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 00:21:14,569 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:21:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:21:14,574 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 00:21:14,590 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:21:14,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:14 BoogieIcfgContainer [2024-10-11 00:21:14,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:21:14,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:21:14,594 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:21:14,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:21:14,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:14" (3/4) ... [2024-10-11 00:21:14,597 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 00:21:14,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:21:14,599 INFO L158 Benchmark]: Toolchain (without parser) took 1340.56ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 93.1MB in the end (delta: 896.1kB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-10-11 00:21:14,599 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:21:14,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.00ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 134.2MB in the end (delta: -40.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-11 00:21:14,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.61ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 132.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:21:14,600 INFO L158 Benchmark]: Boogie Preprocessor took 53.22ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 138.1MB in the end (delta: -5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 00:21:14,601 INFO L158 Benchmark]: RCFGBuilder took 368.94ms. Allocated memory is still 167.8MB. Free memory was 138.1MB in the beginning and 126.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 00:21:14,601 INFO L158 Benchmark]: TraceAbstraction took 581.98ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 93.1MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 00:21:14,601 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 167.8MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:21:14,603 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.00ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 134.2MB in the end (delta: -40.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.61ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 132.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.22ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 138.1MB in the end (delta: -5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 368.94ms. Allocated memory is still 167.8MB. Free memory was 138.1MB in the beginning and 126.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 581.98ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 93.1MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 167.8MB. Free memory is still 93.1MB. 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: 56]: 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 43, overapproximation of to_real at line 39. Possible FailurePath: [L1] int __return_main; [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 VAL [__return_main=0, main__i=0] [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_2=0, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0] [L56] reach_error() VAL [__return_main=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 33 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 00:21:14,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:21:16,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:21:17,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 00:21:17,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:21:17,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:21:17,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:21:17,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:21:17,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:21:17,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:21:17,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:21:17,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:21:17,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:21:17,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:21:17,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:21:17,065 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:21:17,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:21:17,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:21:17,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:21:17,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:21:17,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:21:17,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:21:17,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:21:17,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:21:17,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 00:21:17,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 00:21:17,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:21:17,071 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 00:21:17,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:21:17,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:21:17,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:21:17,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:21:17,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:21:17,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:21:17,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:21:17,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:21:17,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:21:17,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:21:17,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:21:17,083 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 00:21:17,083 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 00:21:17,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:21:17,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:21:17,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:21:17,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:21:17,085 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 00:21:17,085 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2024-10-11 00:21:17,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:21:17,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:21:17,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:21:17,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:21:17,405 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:21:17,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-10-11 00:21:18,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:21:19,067 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:21:19,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-10-11 00:21:19,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba50e60fe/2ccc61d727b149699cb9e8587f6437c0/FLAG1653f3ba4 [2024-10-11 00:21:19,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba50e60fe/2ccc61d727b149699cb9e8587f6437c0 [2024-10-11 00:21:19,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:21:19,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:21:19,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:21:19,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:21:19,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:21:19,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f4af22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19, skipping insertion in model container [2024-10-11 00:21:19,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:21:19,667 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-10-11 00:21:19,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:21:19,699 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:21:19,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-10-11 00:21:19,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:21:19,745 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:21:19,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19 WrapperNode [2024-10-11 00:21:19,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:21:19,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:21:19,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:21:19,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:21:19,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,782 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-10-11 00:21:19,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:21:19,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:21:19,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:21:19,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:21:19,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,811 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 00:21:19,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:21:19,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:21:19,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:21:19,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:21:19,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (1/1) ... [2024-10-11 00:21:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:21:19,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:21:19,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:21:19,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:21:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:21:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 00:21:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:21:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:21:20,040 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:21:20,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:21:24,327 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 00:21:24,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:21:24,353 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:21:24,354 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 00:21:24,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:24 BoogieIcfgContainer [2024-10-11 00:21:24,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:21:24,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:21:24,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:21:24,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:21:24,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:21:19" (1/3) ... [2024-10-11 00:21:24,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea7af33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:24, skipping insertion in model container [2024-10-11 00:21:24,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:19" (2/3) ... [2024-10-11 00:21:24,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea7af33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:24, skipping insertion in model container [2024-10-11 00:21:24,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:24" (3/3) ... [2024-10-11 00:21:24,363 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2024-10-11 00:21:24,379 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:21:24,380 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:21:24,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:21:24,458 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;@68722a63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:21:24,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:21:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:21:24,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:24,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:24,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:24,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1321548500, now seen corresponding path program 1 times [2024-10-11 00:21:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:21:24,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702470511] [2024-10-11 00:21:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:24,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:24,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:21:24,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:21:24,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 00:21:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:24,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:21:24,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:21:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:21:24,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:21:24,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:21:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702470511] [2024-10-11 00:21:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702470511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:24,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:21:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494453364] [2024-10-11 00:21:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:24,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:21:24,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:21:24,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:21:24,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:21:24,720 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:24,811 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2024-10-11 00:21:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:21:24,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 00:21:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:24,820 INFO L225 Difference]: With dead ends: 34 [2024-10-11 00:21:24,820 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 00:21:24,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-11 00:21:24,825 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:21:24,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:21:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 00:21:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 00:21:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-10-11 00:21:24,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 12 [2024-10-11 00:21:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:24,852 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-11 00:21:24,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2024-10-11 00:21:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:21:24,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:24,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:24,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 00:21:25,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:25,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:25,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1145487481, now seen corresponding path program 1 times [2024-10-11 00:21:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:21:25,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470700163] [2024-10-11 00:21:25,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:25,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:25,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:21:25,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:21:25,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 00:21:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:25,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 00:21:25,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:21:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:21:25,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:21:25,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:21:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470700163] [2024-10-11 00:21:25,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470700163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:25,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:25,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:21:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214254825] [2024-10-11 00:21:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:25,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:21:25,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:21:25,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:21:25,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:21:25,248 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:25,337 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2024-10-11 00:21:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:21:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 00:21:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:25,338 INFO L225 Difference]: With dead ends: 18 [2024-10-11 00:21:25,338 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 00:21:25,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:21:25,340 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:21:25,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:21:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 00:21:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 00:21:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-11 00:21:25,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2024-10-11 00:21:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:25,344 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-11 00:21:25,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-10-11 00:21:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:21:25,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:25,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:25,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 00:21:25,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:25,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:25,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1162498142, now seen corresponding path program 1 times [2024-10-11 00:21:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:21:25,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781092986] [2024-10-11 00:21:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:25,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:21:25,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:21:25,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 00:21:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:25,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:21:25,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:21:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:21:25,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:21:25,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:21:25,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781092986] [2024-10-11 00:21:25,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781092986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:25,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:25,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:21:25,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871219549] [2024-10-11 00:21:25,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:21:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:21:25,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:21:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:21:25,666 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:26,519 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-10-11 00:21:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:21:26,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 00:21:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:26,521 INFO L225 Difference]: With dead ends: 41 [2024-10-11 00:21:26,521 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 00:21:26,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-11 00:21:26,522 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 00:21:26,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 00:21:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 00:21:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2024-10-11 00:21:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-11 00:21:26,526 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2024-10-11 00:21:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:26,527 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-11 00:21:26,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-11 00:21:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:21:26,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:26,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:26,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 00:21:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:26,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:26,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1875253687, now seen corresponding path program 1 times [2024-10-11 00:21:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:21:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17616285] [2024-10-11 00:21:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:21:26,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:21:26,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 00:21:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:27,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 00:21:27,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:21:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:21:28,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:21:28,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:21:28,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17616285] [2024-10-11 00:21:28,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17616285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:21:28,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:21:28,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:21:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846026756] [2024-10-11 00:21:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:21:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 00:21:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:21:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 00:21:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:21:28,177 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:33,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 00:21:37,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 00:21:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:21:37,987 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-11 00:21:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 00:21:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 00:21:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:21:38,029 INFO L225 Difference]: With dead ends: 56 [2024-10-11 00:21:38,029 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 00:21:38,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:21:38,030 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-10-11 00:21:38,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 24 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2024-10-11 00:21:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 00:21:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2024-10-11 00:21:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-11 00:21:38,036 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 12 [2024-10-11 00:21:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:21:38,036 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-11 00:21:38,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:21:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-11 00:21:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 00:21:38,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:21:38,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:21:38,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 00:21:38,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:38,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:21:38,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:21:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1153539196, now seen corresponding path program 1 times [2024-10-11 00:21:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:21:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165090078] [2024-10-11 00:21:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:21:38,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:21:38,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:21:38,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:21:38,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 00:21:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:21:38,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 00:21:38,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:22:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:22:01,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:22:10,181 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:22:14,240 WARN L851 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2024-10-11 00:22:18,297 WARN L873 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2024-10-11 00:22:26,423 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:22:34,641 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:22:42,653 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 00:22:46,710 WARN L851 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2024-10-11 00:22:50,769 WARN L873 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2024-10-11 00:22:58,999 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)