./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:48:54,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:48:54,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 21:48:54,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:48:54,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:48:54,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:48:54,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:48:54,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:48:54,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:48:54,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:48:54,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:48:54,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:48:54,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:48:54,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:48:54,824 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:48:54,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:48:54,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:48:54,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:48:54,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 21:48:54,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:48:54,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:48:54,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:48:54,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:48:54,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:48:54,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:48:54,830 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:48:54,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:48:54,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:48:54,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:48:54,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:48:54,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:48:54,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:48:54,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:48:54,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:48:54,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:48:54,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:48:54,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 21:48:54,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 21:48:54,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:48:54,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:48:54,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:48:54,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:48:54,834 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-18 21:48:55,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:48:55,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:48:55,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:48:55,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:48:55,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:48:55,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-11-18 21:48:56,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:48:56,785 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:48:56,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-11-18 21:48:56,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fadd27f9/1fc24784a6c846a9932bbd8a7d562d90/FLAGf29be730f [2024-11-18 21:48:56,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fadd27f9/1fc24784a6c846a9932bbd8a7d562d90 [2024-11-18 21:48:56,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:48:56,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:48:56,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:48:56,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:48:56,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:48:56,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:48:56" (1/1) ... [2024-11-18 21:48:56,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad24622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:56, skipping insertion in model container [2024-11-18 21:48:56,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:48:56" (1/1) ... [2024-11-18 21:48:56,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:48:57,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-11-18 21:48:57,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:48:57,110 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:48:57,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-11-18 21:48:57,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:48:57,179 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:48:57,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57 WrapperNode [2024-11-18 21:48:57,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:48:57,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:48:57,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:48:57,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:48:57,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,247 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-18 21:48:57,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:48:57,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:48:57,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:48:57,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:48:57,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,296 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 21:48:57,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:48:57,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:48:57,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:48:57,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:48:57,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (1/1) ... [2024-11-18 21:48:57,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:48:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:48:57,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 21:48:57,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 21:48:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:48:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:48:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:48:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 21:48:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:48:57,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:48:57,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:48:57,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:48:57,868 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 21:48:57,869 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:48:57,888 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:48:57,889 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:48:57,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:48:57 BoogieIcfgContainer [2024-11-18 21:48:57,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:48:57,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:48:57,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:48:57,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:48:57,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:48:56" (1/3) ... [2024-11-18 21:48:57,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f7d884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:48:57, skipping insertion in model container [2024-11-18 21:48:57,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:48:57" (2/3) ... [2024-11-18 21:48:57,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f7d884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:48:57, skipping insertion in model container [2024-11-18 21:48:57,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:48:57" (3/3) ... [2024-11-18 21:48:57,899 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2024-11-18 21:48:57,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:48:57,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:48:57,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:48:57,988 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;@139475fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:48:57,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:48:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 21:48:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-18 21:48:58,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:48:58,003 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:48:58,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:48:58,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:48:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1623939, now seen corresponding path program 1 times [2024-11-18 21:48:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:48:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905793454] [2024-11-18 21:48:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:48:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:48:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:48:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-18 21:48:58,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:48:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905793454] [2024-11-18 21:48:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905793454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 21:48:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669087341] [2024-11-18 21:48:58,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:48:58,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:48:58,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:48:58,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:48:58,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 21:48:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:48:58,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:48:58,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:48:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-18 21:48:58,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:48:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669087341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:48:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 21:48:58,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 21:48:58,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145891642] [2024-11-18 21:48:58,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:48:58,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:48:58,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:48:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:48:58,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:48:58,572 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:48:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:48:58,607 INFO L93 Difference]: Finished difference Result 135 states and 229 transitions. [2024-11-18 21:48:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:48:58,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2024-11-18 21:48:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:48:58,618 INFO L225 Difference]: With dead ends: 135 [2024-11-18 21:48:58,618 INFO L226 Difference]: Without dead ends: 67 [2024-11-18 21:48:58,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:48:58,627 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:48:58,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:48:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-18 21:48:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-18 21:48:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 21:48:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 102 transitions. [2024-11-18 21:48:58,695 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 102 transitions. Word has length 105 [2024-11-18 21:48:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:48:58,696 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 102 transitions. [2024-11-18 21:48:58,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:48:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 102 transitions. [2024-11-18 21:48:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-18 21:48:58,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:48:58,703 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:48:58,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 21:48:58,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 21:48:58,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:48:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:48:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash -662991041, now seen corresponding path program 1 times [2024-11-18 21:48:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:48:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944214681] [2024-11-18 21:48:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:48:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:48:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:48:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:48:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:48:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944214681] [2024-11-18 21:48:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944214681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:48:59,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:48:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:48:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128008233] [2024-11-18 21:48:59,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:48:59,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:48:59,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:48:59,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:48:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:48:59,294 INFO L87 Difference]: Start difference. First operand 67 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:48:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:48:59,387 INFO L93 Difference]: Finished difference Result 195 states and 300 transitions. [2024-11-18 21:48:59,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:48:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-18 21:48:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:48:59,391 INFO L225 Difference]: With dead ends: 195 [2024-11-18 21:48:59,393 INFO L226 Difference]: Without dead ends: 131 [2024-11-18 21:48:59,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:48:59,395 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:48:59,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:48:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-18 21:48:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-18 21:48:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-18 21:48:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions. [2024-11-18 21:48:59,428 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 105 [2024-11-18 21:48:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:48:59,429 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions. [2024-11-18 21:48:59,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:48:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions. [2024-11-18 21:48:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-18 21:48:59,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:48:59,432 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:48:59,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 21:48:59,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:48:59,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:48:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1292298218, now seen corresponding path program 1 times [2024-11-18 21:48:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:48:59,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957871750] [2024-11-18 21:48:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:48:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:48:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:48:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:48:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:48:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957871750] [2024-11-18 21:48:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957871750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:48:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:48:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:48:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975702972] [2024-11-18 21:48:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:48:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:48:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:48:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:48:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:48:59,615 INFO L87 Difference]: Start difference. First operand 129 states and 196 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:48:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:48:59,721 INFO L93 Difference]: Finished difference Result 373 states and 572 transitions. [2024-11-18 21:48:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:48:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-11-18 21:48:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:48:59,724 INFO L225 Difference]: With dead ends: 373 [2024-11-18 21:48:59,724 INFO L226 Difference]: Without dead ends: 247 [2024-11-18 21:48:59,726 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-11-18 21:48:59,728 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 86 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:48:59,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 257 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:48:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-18 21:48:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2024-11-18 21:48:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 21:48:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2024-11-18 21:48:59,773 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 106 [2024-11-18 21:48:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:48:59,774 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2024-11-18 21:48:59,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:48:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2024-11-18 21:48:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-18 21:48:59,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:48:59,777 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:48:59,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 21:48:59,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:48:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:48:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash 257019204, now seen corresponding path program 1 times [2024-11-18 21:48:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:48:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815811999] [2024-11-18 21:48:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:48:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:48:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:48:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:48:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:48:59,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815811999] [2024-11-18 21:48:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815811999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:48:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:48:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:48:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825050393] [2024-11-18 21:48:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:48:59,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:48:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:48:59,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:48:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:48:59,904 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:48:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:48:59,977 INFO L93 Difference]: Finished difference Result 605 states and 914 transitions. [2024-11-18 21:48:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:48:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-11-18 21:48:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:48:59,985 INFO L225 Difference]: With dead ends: 605 [2024-11-18 21:48:59,985 INFO L226 Difference]: Without dead ends: 363 [2024-11-18 21:48:59,987 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-11-18 21:48:59,992 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 43 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:48:59,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 216 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:48:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-18 21:49:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 281. [2024-11-18 21:49:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.4074074074074074) internal successors, (304), 216 states have internal predecessors, (304), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 21:49:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 424 transitions. [2024-11-18 21:49:00,046 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 424 transitions. Word has length 106 [2024-11-18 21:49:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:00,047 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 424 transitions. [2024-11-18 21:49:00,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 424 transitions. [2024-11-18 21:49:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-18 21:49:00,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:00,052 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:00,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 21:49:00,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:00,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash -453972667, now seen corresponding path program 1 times [2024-11-18 21:49:00,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:49:00,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278419387] [2024-11-18 21:49:00,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:00,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:49:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-18 21:49:01,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:49:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278419387] [2024-11-18 21:49:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278419387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:49:01,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:49:01,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 21:49:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715665747] [2024-11-18 21:49:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:49:01,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 21:49:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:49:01,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 21:49:01,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 21:49:01,179 INFO L87 Difference]: Start difference. First operand 281 states and 424 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:49:02,047 INFO L93 Difference]: Finished difference Result 857 states and 1248 transitions. [2024-11-18 21:49:02,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 21:49:02,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-18 21:49:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:49:02,055 INFO L225 Difference]: With dead ends: 857 [2024-11-18 21:49:02,056 INFO L226 Difference]: Without dead ends: 579 [2024-11-18 21:49:02,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-18 21:49:02,059 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 253 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 21:49:02,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 329 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 21:49:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-18 21:49:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 351. [2024-11-18 21:49:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 282 states have (on average 1.4219858156028369) internal successors, (401), 282 states have internal predecessors, (401), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-18 21:49:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 521 transitions. [2024-11-18 21:49:02,116 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 521 transitions. Word has length 107 [2024-11-18 21:49:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:02,118 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 521 transitions. [2024-11-18 21:49:02,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 521 transitions. [2024-11-18 21:49:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-18 21:49:02,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:02,121 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:02,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 21:49:02,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:02,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2042320569, now seen corresponding path program 1 times [2024-11-18 21:49:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:49:02,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185515017] [2024-11-18 21:49:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:49:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:49:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:49:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185515017] [2024-11-18 21:49:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185515017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:49:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:49:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:49:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421629193] [2024-11-18 21:49:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:49:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:49:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:49:02,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:49:02,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:49:02,283 INFO L87 Difference]: Start difference. First operand 351 states and 521 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:49:02,384 INFO L93 Difference]: Finished difference Result 851 states and 1264 transitions. [2024-11-18 21:49:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:49:02,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-18 21:49:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:49:02,389 INFO L225 Difference]: With dead ends: 851 [2024-11-18 21:49:02,390 INFO L226 Difference]: Without dead ends: 503 [2024-11-18 21:49:02,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:49:02,393 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:49:02,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 209 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:49:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-18 21:49:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2024-11-18 21:49:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 398 states have (on average 1.4095477386934674) internal successors, (561), 398 states have internal predecessors, (561), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-18 21:49:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 741 transitions. [2024-11-18 21:49:02,457 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 741 transitions. Word has length 107 [2024-11-18 21:49:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:02,458 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 741 transitions. [2024-11-18 21:49:02,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 741 transitions. [2024-11-18 21:49:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-18 21:49:02,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:02,462 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:02,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 21:49:02,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:02,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash 66668527, now seen corresponding path program 1 times [2024-11-18 21:49:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:49:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39652135] [2024-11-18 21:49:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:49:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:49:02,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:49:02,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39652135] [2024-11-18 21:49:02,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39652135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:49:02,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:49:02,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 21:49:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241608822] [2024-11-18 21:49:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:49:02,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 21:49:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:49:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 21:49:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 21:49:02,706 INFO L87 Difference]: Start difference. First operand 501 states and 741 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:49:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:49:03,167 INFO L93 Difference]: Finished difference Result 1409 states and 2091 transitions. [2024-11-18 21:49:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 21:49:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2024-11-18 21:49:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:49:03,175 INFO L225 Difference]: With dead ends: 1409 [2024-11-18 21:49:03,176 INFO L226 Difference]: Without dead ends: 1159 [2024-11-18 21:49:03,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-18 21:49:03,178 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 298 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 21:49:03,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 21:49:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-18 21:49:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1143. [2024-11-18 21:49:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 904 states have (on average 1.413716814159292) internal successors, (1278), 904 states have internal predecessors, (1278), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-18 21:49:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1698 transitions. [2024-11-18 21:49:03,321 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1698 transitions. Word has length 107 [2024-11-18 21:49:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:03,322 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1698 transitions. [2024-11-18 21:49:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:49:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1698 transitions. [2024-11-18 21:49:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 21:49:03,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:03,324 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:03,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 21:49:03,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:03,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1351691309, now seen corresponding path program 1 times [2024-11-18 21:49:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:49:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963389751] [2024-11-18 21:49:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:49:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:49:03,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:49:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963389751] [2024-11-18 21:49:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963389751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:49:03,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:49:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 21:49:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881392558] [2024-11-18 21:49:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:49:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 21:49:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:49:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 21:49:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-18 21:49:03,645 INFO L87 Difference]: Start difference. First operand 1143 states and 1698 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:49:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:49:04,232 INFO L93 Difference]: Finished difference Result 2305 states and 3417 transitions. [2024-11-18 21:49:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 21:49:04,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-18 21:49:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:49:04,240 INFO L225 Difference]: With dead ends: 2305 [2024-11-18 21:49:04,240 INFO L226 Difference]: Without dead ends: 1165 [2024-11-18 21:49:04,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-18 21:49:04,244 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 367 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 21:49:04,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 464 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 21:49:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2024-11-18 21:49:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1145. [2024-11-18 21:49:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 906 states have (on average 1.4094922737306843) internal successors, (1277), 906 states have internal predecessors, (1277), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-18 21:49:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1697 transitions. [2024-11-18 21:49:04,351 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1697 transitions. Word has length 108 [2024-11-18 21:49:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:04,351 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1697 transitions. [2024-11-18 21:49:04,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:49:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1697 transitions. [2024-11-18 21:49:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 21:49:04,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:04,353 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:04,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 21:49:04,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:04,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash 685923855, now seen corresponding path program 1 times [2024-11-18 21:49:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:49:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922276141] [2024-11-18 21:49:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:49:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 21:49:05,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:49:05,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922276141] [2024-11-18 21:49:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922276141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 21:49:05,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335232252] [2024-11-18 21:49:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:05,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:49:05,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:49:05,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:49:05,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 21:49:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:05,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-18 21:49:05,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:49:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-18 21:49:06,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 21:49:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-18 21:49:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335232252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 21:49:07,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 21:49:07,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2024-11-18 21:49:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485561801] [2024-11-18 21:49:07,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 21:49:07,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-18 21:49:07,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:49:07,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-18 21:49:07,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2024-11-18 21:49:07,263 INFO L87 Difference]: Start difference. First operand 1145 states and 1697 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-18 21:49:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:49:08,814 INFO L93 Difference]: Finished difference Result 2139 states and 3046 transitions. [2024-11-18 21:49:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-18 21:49:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) Word has length 108 [2024-11-18 21:49:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:49:08,821 INFO L225 Difference]: With dead ends: 2139 [2024-11-18 21:49:08,821 INFO L226 Difference]: Without dead ends: 1297 [2024-11-18 21:49:08,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1097, Invalid=2563, Unknown=0, NotChecked=0, Total=3660 [2024-11-18 21:49:08,825 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 440 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 21:49:08,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 445 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 21:49:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-11-18 21:49:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 527. [2024-11-18 21:49:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 406 states have (on average 1.3226600985221675) internal successors, (537), 406 states have internal predecessors, (537), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-18 21:49:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 717 transitions. [2024-11-18 21:49:08,901 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 717 transitions. Word has length 108 [2024-11-18 21:49:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 717 transitions. [2024-11-18 21:49:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-18 21:49:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 717 transitions. [2024-11-18 21:49:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-18 21:49:08,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:08,903 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:08,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 21:49:09,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-18 21:49:09,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:09,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 206212576, now seen corresponding path program 1 times [2024-11-18 21:49:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:49:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251173171] [2024-11-18 21:49:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:49:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:49:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:49:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251173171] [2024-11-18 21:49:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251173171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:49:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:49:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 21:49:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32234163] [2024-11-18 21:49:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:49:09,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 21:49:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:49:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 21:49:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 21:49:09,301 INFO L87 Difference]: Start difference. First operand 527 states and 717 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:49:09,583 INFO L93 Difference]: Finished difference Result 1356 states and 1873 transitions. [2024-11-18 21:49:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 21:49:09,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-18 21:49:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:49:09,589 INFO L225 Difference]: With dead ends: 1356 [2024-11-18 21:49:09,589 INFO L226 Difference]: Without dead ends: 1091 [2024-11-18 21:49:09,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 21:49:09,590 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 177 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:49:09,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 366 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:49:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2024-11-18 21:49:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 955. [2024-11-18 21:49:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 754 states have (on average 1.343501326259947) internal successors, (1013), 754 states have internal predecessors, (1013), 150 states have call successors, (150), 50 states have call predecessors, (150), 50 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-18 21:49:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1313 transitions. [2024-11-18 21:49:09,732 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1313 transitions. Word has length 108 [2024-11-18 21:49:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1313 transitions. [2024-11-18 21:49:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1313 transitions. [2024-11-18 21:49:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 21:49:09,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:09,734 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:09,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 21:49:09,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1387213154, now seen corresponding path program 1 times [2024-11-18 21:49:09,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:49:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031165658] [2024-11-18 21:49:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:49:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 21:49:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286622708] [2024-11-18 21:49:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:09,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:49:09,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:49:09,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:49:09,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 21:49:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 21:49:09,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 21:49:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 21:49:10,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 21:49:10,013 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 21:49:10,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 21:49:10,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 21:49:10,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:49:10,219 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:10,308 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 21:49:10,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:49:10 BoogieIcfgContainer [2024-11-18 21:49:10,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 21:49:10,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 21:49:10,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 21:49:10,313 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 21:49:10,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:48:57" (3/4) ... [2024-11-18 21:49:10,316 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 21:49:10,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 21:49:10,317 INFO L158 Benchmark]: Toolchain (without parser) took 13504.11ms. Allocated memory was 134.2MB in the beginning and 327.2MB in the end (delta: 192.9MB). Free memory was 63.7MB in the beginning and 239.9MB in the end (delta: -176.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-18 21:49:10,318 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 21:49:10,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.65ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 63.7MB in the beginning and 157.9MB in the end (delta: -94.2MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-18 21:49:10,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.96ms. Allocated memory is still 188.7MB. Free memory was 157.9MB in the beginning and 155.7MB in the end (delta: 2.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-11-18 21:49:10,319 INFO L158 Benchmark]: Boogie Preprocessor took 87.13ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 150.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 21:49:10,319 INFO L158 Benchmark]: RCFGBuilder took 554.34ms. Allocated memory is still 188.7MB. Free memory was 150.4MB in the beginning and 127.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-18 21:49:10,320 INFO L158 Benchmark]: TraceAbstraction took 12419.35ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 126.3MB in the beginning and 240.9MB in the end (delta: -114.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-18 21:49:10,320 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 327.2MB. Free memory was 240.9MB in the beginning and 239.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 21:49:10,322 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 134.2MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.65ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 63.7MB in the beginning and 157.9MB in the end (delta: -94.2MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.96ms. Allocated memory is still 188.7MB. Free memory was 157.9MB in the beginning and 155.7MB in the end (delta: 2.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.13ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 150.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 554.34ms. Allocated memory is still 188.7MB. Free memory was 150.4MB in the beginning and 127.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12419.35ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 126.3MB in the beginning and 240.9MB in the end (delta: -114.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 327.2MB. Free memory was 240.9MB in the beginning and 239.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L51] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L82] COND FALSE !(var_1_12 == var_1_12) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1793 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1787 mSDsluCounter, 3037 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1952 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1483 IncrementalHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 1085 mSDtfsCounter, 1483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 1258 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1498 NumberOfCodeBlocks, 1498 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 5492 SizeOfPredicates, 6 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 5351/5460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 21:49:10,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:49:12,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:49:12,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 21:49:12,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:49:12,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:49:12,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:49:12,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:49:12,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:49:12,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:49:12,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:49:12,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:49:12,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:49:12,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:49:12,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:49:12,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:49:12,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:49:12,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:49:12,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:49:12,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:49:12,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:49:12,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:49:12,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:49:12,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:49:12,788 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 21:49:12,789 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 21:49:12,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:49:12,789 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 21:49:12,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:49:12,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:49:12,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:49:12,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:49:12,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:49:12,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:49:12,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:49:12,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:49:12,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:49:12,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:49:12,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:49:12,792 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 21:49:12,792 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 21:49:12,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:49:12,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:49:12,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:49:12,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:49:12,795 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-18 21:49:13,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:49:13,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:49:13,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:49:13,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:49:13,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:49:13,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-11-18 21:49:14,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:49:14,919 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:49:14,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i [2024-11-18 21:49:14,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eb9fbdc/106fc7b647ad4c579d5632388528d01d/FLAG02f5f975d [2024-11-18 21:49:14,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eb9fbdc/106fc7b647ad4c579d5632388528d01d [2024-11-18 21:49:14,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:49:14,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:49:14,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:49:14,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:49:14,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:49:14,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:49:14" (1/1) ... [2024-11-18 21:49:14,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f9969a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:14, skipping insertion in model container [2024-11-18 21:49:14,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:49:14" (1/1) ... [2024-11-18 21:49:14,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:49:15,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-11-18 21:49:15,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:49:15,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:49:15,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-3.i[912,925] [2024-11-18 21:49:15,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:49:15,351 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:49:15,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15 WrapperNode [2024-11-18 21:49:15,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:49:15,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:49:15,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:49:15,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:49:15,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,411 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-18 21:49:15,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:49:15,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:49:15,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:49:15,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:49:15,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 21:49:15,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:49:15,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:49:15,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:49:15,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:49:15,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (1/1) ... [2024-11-18 21:49:15,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:49:15,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:49:15,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 21:49:15,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 21:49:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:49:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 21:49:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:49:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:49:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:49:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:49:15,664 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:49:15,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:49:33,091 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 21:49:33,095 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:49:33,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:49:33,113 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:49:33,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:49:33 BoogieIcfgContainer [2024-11-18 21:49:33,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:49:33,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:49:33,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:49:33,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:49:33,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:49:14" (1/3) ... [2024-11-18 21:49:33,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4642ddda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:49:33, skipping insertion in model container [2024-11-18 21:49:33,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:15" (2/3) ... [2024-11-18 21:49:33,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4642ddda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:49:33, skipping insertion in model container [2024-11-18 21:49:33,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:49:33" (3/3) ... [2024-11-18 21:49:33,126 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-3.i [2024-11-18 21:49:33,143 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:49:33,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:49:33,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:49:33,224 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;@78a45c10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:49:33,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:49:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 21:49:33,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 21:49:33,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:33,243 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:33,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 990176220, now seen corresponding path program 1 times [2024-11-18 21:49:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:49:33,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342919196] [2024-11-18 21:49:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:33,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:49:33,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:49:33,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 21:49:33,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 21:49:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:34,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:49:34,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:49:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-18 21:49:34,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:49:34,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:49:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342919196] [2024-11-18 21:49:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342919196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:49:34,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:49:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 21:49:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365510519] [2024-11-18 21:49:34,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:49:34,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:49:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:49:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:49:34,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:49:34,296 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:49:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:49:34,332 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2024-11-18 21:49:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:49:34,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-11-18 21:49:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:49:34,342 INFO L225 Difference]: With dead ends: 113 [2024-11-18 21:49:34,343 INFO L226 Difference]: Without dead ends: 56 [2024-11-18 21:49:34,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:49:34,351 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:49:34,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:49:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-18 21:49:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-18 21:49:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 21:49:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-18 21:49:34,402 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 102 [2024-11-18 21:49:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:49:34,403 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-18 21:49:34,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 21:49:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-18 21:49:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 21:49:34,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:49:34,407 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:49:34,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 21:49:34,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:49:34,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:49:34,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:49:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1728304218, now seen corresponding path program 1 times [2024-11-18 21:49:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:49:34,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478754787] [2024-11-18 21:49:34,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:49:34,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:49:34,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:49:34,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 21:49:34,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 21:49:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:49:35,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 21:49:35,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:49:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:49:38,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:49:38,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:49:38,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478754787] [2024-11-18 21:49:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478754787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:49:38,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:49:38,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:49:38,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963455786] [2024-11-18 21:49:38,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:49:38,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 21:49:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:49:38,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 21:49:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 21:49:38,423 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:49:42,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:49:46,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:49:50,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:49:54,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:49:58,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:01,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:05,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:07,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:11,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:15,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:19,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:23,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 21:50:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:50:23,817 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions. [2024-11-18 21:50:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 21:50:23,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-18 21:50:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:50:23,938 INFO L225 Difference]: With dead ends: 162 [2024-11-18 21:50:23,939 INFO L226 Difference]: Without dead ends: 109 [2024-11-18 21:50:23,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 21:50:23,940 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 30 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2024-11-18 21:50:23,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 247 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 45.3s Time] [2024-11-18 21:50:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-18 21:50:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-18 21:50:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-18 21:50:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 161 transitions. [2024-11-18 21:50:23,970 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 161 transitions. Word has length 102 [2024-11-18 21:50:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:50:23,971 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 161 transitions. [2024-11-18 21:50:23,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-18 21:50:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 161 transitions. [2024-11-18 21:50:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-18 21:50:23,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:50:23,973 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:50:24,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 21:50:24,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:50:24,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:50:24,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:50:24,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1759076794, now seen corresponding path program 1 times [2024-11-18 21:50:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:50:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884582391] [2024-11-18 21:50:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:50:24,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:50:24,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:50:24,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 21:50:24,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 21:50:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:50:25,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 21:50:25,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:50:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-18 21:50:25,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:50:25,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:50:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884582391] [2024-11-18 21:50:25,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884582391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:50:25,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:50:25,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:50:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023051704] [2024-11-18 21:50:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:50:25,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:50:25,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:50:25,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:50:25,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:50:25,246 INFO L87 Difference]: Start difference. First operand 107 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)