./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 67e1f0759ae3eef1dbaa6f8b0d73161640ce69ba156f9f744d71e8aa9cf95f87 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:43:47,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:43:47,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:43:47,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:43:47,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:43:47,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:43:47,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:43:47,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:43:47,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:43:47,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:43:47,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:43:47,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:43:47,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:43:47,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:43:47,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:43:47,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:43:47,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:43:47,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:43:47,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:43:47,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:43:47,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:43:47,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:43:47,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:43:47,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:43:47,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:43:47,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:43:47,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:43:47,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:43:47,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:43:47,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:43:47,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:43:47,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:43:47,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:43:47,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:43:47,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:43:47,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:43:47,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:43:47,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:43:47,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:43:47,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:43:47,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:43:47,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:43:47,454 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 67e1f0759ae3eef1dbaa6f8b0d73161640ce69ba156f9f744d71e8aa9cf95f87 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:43:47,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:43:47,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:43:47,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:43:47,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:43:47,722 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:43:47,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i [2024-10-15 14:43:49,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:43:49,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:43:49,270 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i [2024-10-15 14:43:49,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4dc6ee284/25ef0375de334b8f8d7ad35ae05119bd/FLAG8aee364e3 [2024-10-15 14:43:49,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4dc6ee284/25ef0375de334b8f8d7ad35ae05119bd [2024-10-15 14:43:49,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:43:49,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:43:49,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:43:49,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:43:49,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:43:49,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f176e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49, skipping insertion in model container [2024-10-15 14:43:49,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:43:49,501 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i[950,963] [2024-10-15 14:43:49,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:43:49,529 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:43:49,542 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i[950,963] [2024-10-15 14:43:49,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:43:49,571 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:43:49,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49 WrapperNode [2024-10-15 14:43:49,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:43:49,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:43:49,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:43:49,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:43:49,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,594 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:43:49,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:43:49,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:43:49,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:43:49,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:43:49,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,631 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:43:49,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:43:49,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:43:49,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:43:49,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:43:49,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (1/1) ... [2024-10-15 14:43:49,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:43:49,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:43:49,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:43:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:43:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:43:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:43:49,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:43:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:43:49,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:43:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:43:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:43:49,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:43:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:43:49,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:43:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:43:49,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:43:49,777 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:43:49,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:43:49,908 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:43:49,909 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:43:49,927 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:43:49,927 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:43:49,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:43:49 BoogieIcfgContainer [2024-10-15 14:43:49,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:43:49,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:43:49,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:43:49,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:43:49,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:43:49" (1/3) ... [2024-10-15 14:43:49,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eba0336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:43:49, skipping insertion in model container [2024-10-15 14:43:49,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:43:49" (2/3) ... [2024-10-15 14:43:49,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eba0336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:43:49, skipping insertion in model container [2024-10-15 14:43:49,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:43:49" (3/3) ... [2024-10-15 14:43:49,936 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound20.i [2024-10-15 14:43:49,951 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:43:49,951 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:43:49,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:43:50,004 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=All, 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;@2e64b1ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:43:50,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:43:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:43:50,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-15 14:43:50,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:43:50,020 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:43:50,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:43:50,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-10-15 14:43:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:43:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867364170] [2024-10-15 14:43:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:43:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:43:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:43:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:43:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:43:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:43:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:43:50,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:43:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867364170] [2024-10-15 14:43:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867364170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:43:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:43:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:43:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043374492] [2024-10-15 14:43:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:43:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:43:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:43:50,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:43:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:43:50,310 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:43:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:43:50,345 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-10-15 14:43:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:43:50,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-15 14:43:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:43:50,354 INFO L225 Difference]: With dead ends: 58 [2024-10-15 14:43:50,355 INFO L226 Difference]: Without dead ends: 28 [2024-10-15 14:43:50,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-10-15 14:43:50,360 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:43:50,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:43:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-15 14:43:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-15 14:43:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-15 14:43:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-15 14:43:50,392 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-10-15 14:43:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:43:50,393 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-15 14:43:50,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:43:50,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-15 14:43:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-15 14:43:50,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:43:50,396 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:43:50,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:43:50,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:43:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-10-15 14:43:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:43:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862411816] [2024-10-15 14:43:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:43:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:43:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413638549] [2024-10-15 14:43:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:43:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:43:50,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:43:50,462 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:43:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:50,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 14:43:50,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:43:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:43:50,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:43:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:43:51,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:43:51,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862411816] [2024-10-15 14:43:51,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:43:51,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413638549] [2024-10-15 14:43:51,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413638549] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:43:51,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:43:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-10-15 14:43:51,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353342465] [2024-10-15 14:43:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:43:51,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:43:51,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:43:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:43:51,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:43:51,031 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-15 14:43:55,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-10-15 14:43:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:43:55,129 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-15 14:43:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:43:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-10-15 14:43:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:43:55,131 INFO L225 Difference]: With dead ends: 38 [2024-10-15 14:43:55,131 INFO L226 Difference]: Without dead ends: 35 [2024-10-15 14:43:55,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:43:55,133 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:43:55,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-15 14:43:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-15 14:43:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-15 14:43:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 14:43:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-15 14:43:55,148 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2024-10-15 14:43:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:43:55,153 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-15 14:43:55,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-15 14:43:55,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-15 14:43:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-15 14:43:55,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:43:55,157 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 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-10-15 14:43:55,174 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:43:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:43:55,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:43:55,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-10-15 14:43:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:43:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394553175] [2024-10-15 14:43:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:43:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:43:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:43:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:43:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:43:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:43:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-15 14:43:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:43:56,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:43:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394553175] [2024-10-15 14:43:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394553175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:43:56,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:43:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:43:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850149823] [2024-10-15 14:43:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:43:56,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:43:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:43:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:43:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:43:56,006 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:43:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:43:56,055 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-10-15 14:43:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:43:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-10-15 14:43:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:43:56,056 INFO L225 Difference]: With dead ends: 51 [2024-10-15 14:43:56,058 INFO L226 Difference]: Without dead ends: 37 [2024-10-15 14:43:56,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:43:56,059 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:43:56,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:43:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-15 14:43:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-15 14:43:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 14:43:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-15 14:43:56,071 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-10-15 14:43:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:43:56,071 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-15 14:43:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:43:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-15 14:43:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:43:56,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:43:56,073 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 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-10-15 14:43:56,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:43:56,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:43:56,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-10-15 14:43:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:43:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98164074] [2024-10-15 14:43:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:43:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:43:56,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277778502] [2024-10-15 14:43:56,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:43:56,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:43:56,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:43:56,130 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:43:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:56,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-15 14:43:56,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:43:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-15 14:43:56,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:43:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:43:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98164074] [2024-10-15 14:43:56,609 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:43:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277778502] [2024-10-15 14:43:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277778502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:43:56,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:43:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-15 14:43:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014463399] [2024-10-15 14:43:56,610 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-15 14:43:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:43:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:43:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:43:56,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:43:56,612 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:43:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:43:56,755 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-10-15 14:43:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 14:43:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-10-15 14:43:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:43:56,757 INFO L225 Difference]: With dead ends: 52 [2024-10-15 14:43:56,757 INFO L226 Difference]: Without dead ends: 48 [2024-10-15 14:43:56,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:43:56,759 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:43:56,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 148 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:43:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-15 14:43:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-15 14:43:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 14:43:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-15 14:43:56,771 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 44 [2024-10-15 14:43:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:43:56,772 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-15 14:43:56,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:43:56,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-15 14:43:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-15 14:43:56,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:43:56,774 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:43:56,783 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:43:56,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:43:56,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:43:56,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-10-15 14:43:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:43:56,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808477061] [2024-10-15 14:43:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:43:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:43:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:43:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:43:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:43:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:43:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-15 14:43:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:43:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:43:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 14:43:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:43:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808477061] [2024-10-15 14:43:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808477061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:43:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998367084] [2024-10-15 14:43:57,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:43:57,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:43:57,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:43:57,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:43:57,514 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:43:57,635 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:43:57,635 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:43:57,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-15 14:43:57,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:43:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-15 14:43:58,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:43:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 14:43:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998367084] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:43:58,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:43:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 21 [2024-10-15 14:43:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835808995] [2024-10-15 14:43:58,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:43:58,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-15 14:43:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:43:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 14:43:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:43:58,770 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-15 14:43:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:43:59,630 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2024-10-15 14:43:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:43:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) Word has length 52 [2024-10-15 14:43:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:43:59,634 INFO L225 Difference]: With dead ends: 83 [2024-10-15 14:43:59,634 INFO L226 Difference]: Without dead ends: 54 [2024-10-15 14:43:59,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:43:59,635 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:43:59,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 207 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-15 14:43:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-15 14:43:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-10-15 14:43:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 14:43:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-10-15 14:43:59,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2024-10-15 14:43:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:43:59,655 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-15 14:43:59,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2024-10-15 14:43:59,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-10-15 14:43:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:43:59,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:43:59,657 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:43:59,665 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:43:59,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:43:59,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:43:59,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:43:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-10-15 14:43:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:43:59,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969529065] [2024-10-15 14:43:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:43:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:43:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:43:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261712263] [2024-10-15 14:43:59,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:43:59,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:43:59,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:43:59,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:43:59,958 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:44:00,558 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-15 14:44:00,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:44:00,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-15 14:44:00,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:44:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 14:44:02,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:44:23,565 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:44:57,121 WARN L286 SmtUtils]: Spent 31.17s on a formula simplification. DAG size of input: 38 DAG size of output: 35 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2024-10-15 14:45:05,421 WARN L286 SmtUtils]: Spent 7.83s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:45:17,256 WARN L286 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 36 DAG size of output: 23 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2024-10-15 14:45:25,677 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:45:51,852 WARN L286 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 60 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:46:16,207 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:46:32,243 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:47:00,331 WARN L286 SmtUtils]: Spent 28.09s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:47:10,800 WARN L286 SmtUtils]: Spent 10.47s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:47:18,996 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (* c_main_~b~0 c_main_~q~0) 1073741824)) (.cse2 (mod c_main_~b~0 1073741824))) (let ((.cse3 (mod c_main_~B~0 4294967296)) (.cse0 (* (mod (* .cse2 c_main_~q~0) 1073741824) 4)) (.cse1 (* 4294967292 .cse5)) (.cse4 (* .cse2 4))) (or (< 4294967295 (+ .cse0 (mod (+ .cse1 c_main_~A~0) 4294967296))) (= (* .cse2 2) .cse3) (= .cse4 .cse3) (< (+ 4294967294 .cse0) (+ (mod (+ .cse1 (* .cse2 c_main_~q~0 4) 4294967295) 4294967296) (mod c_main_~A~0 4294967296))) (< .cse4 (+ (mod (+ .cse4 (* c_main_~A~0 4294967295) 4294967295 (* 4 .cse5)) 4294967296) (* 2 (mod c_main_~b~0 2147483648)) 1))))) is different from true [2024-10-15 14:47:35,044 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:48:07,261 WARN L286 SmtUtils]: Spent 28.06s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:48:23,291 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)